The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in this paper: 1) The well-known Prisoners' Dilemma can be categorized into three types and only the third type is adaptable for quantum strategies. 2) As a reverse problem of game theory, mechanism design provides a better circumstance for quantum strategies than game theory does.
The Prisoners' Dilemma is perhaps the most famous model in the field of game theory. Consequently, it is natural to investigate its quantum version when one considers to apply quantum strategies to game theory. There are two main results in this paper: 1) The well-known Prisoners' Dilemma can be categorized into three types and only the third type is adaptable for quantum strategies. 2) As a reverse problem of game theory, mechanism design provides a better circumstance for quantum strategies than game theory does.
Purpose The current paper is a brief review of the emerging field of quantum-like modelling in game theory. This paper aims to explore several quantum games, which are superior compared to their classical counterparts, which means either they give rise to superior Nash equilibria or they make the game fairer. For example, quantum Prisoners Dilemma generates Pareto superior outcomes as compared to defection outcome in the famous classical case. Again, a quantum-like version of cards game can make the game fairer, increasing the chance of winning of players who are disadvantaged in the classical case. This paper explores all the virtues of simple quantum games, also highlighting some findings of the authors as regards Prisoners Dilemma game. Design/methodology/approach As this is a general review paper, the authors have not demonstrated any specific mathematical method, rather explored the well-known quantum probability framework, used for designing quantum games. They have a short appendix which explores basic structure of Hilbert space representation of human decision-making. Findings Along with the review of the extant literature, the authors have also highlighted some new findings for quantum Prisoners Dilemma game. Specifically, they have shown in the earlier studies (which are referred to here) that a pure quantum entanglement set up is not needed for designing better games, even a weaker condition, which is classical entanglement is sufficient for producing Pareto improved outcomes. Research limitations/implications Theoretical research, with findings and implications for future game designs, it has been argued that it is not always needed to have true quantum entanglement for superior Nash Equilibria. Originality/value The main purpose here is to raise awareness mainly in the social science community about the possible applications of quantum-like game theory paradigm. The findings related to Prisoners Dilemma game are, however, original.
Theory of games is an important discipline of applied mathematics, which has found numerous applications in psychology, ecology, and social science. While a well-established framework has been established for classical game theory, extending, and generalizing it towards the quantum domain still has some open questions. In this project, we focus on the prisoner’s dilemma-a standard example of a game analyzed in game theory-in a quantum world. Here, we start with the quantum version of prisoner’s dilemma, explain the quantum circuit implementation for describing the behavior of quantum prisoners, and investigate how quantum entanglement can change their strategies. By using the IBM quantum computer, we experimentally study the quantum prisoner dilemma, and we conclude that the best quantum strategies will break the prisoner’s dilemma.
Decision-making by the two negotiating parties is simulated by a prisoner's dilemma game.The game is formulated in a quantum manner, where players strategies are unitary transformations of qubits built over the basis of opposite decision options.Quantum strategies are correlated through the mechanism of quantum entanglement and the result of the game is obtained by the collapse of the resulting transformed state.The range of strategies allowed for quantum players is richer than in case of a classical game and therefore the result of the game can be better optimized.On the other hand, the quantum game is save against eavesdropping and the players can be assured that this type of quantum arbitration is fair.We show that quantum prisoner's dilemma has more favorable Nash equilibria than its classical analog and they are close to the Pareto optimal solutions.Some economical examples of utilizing quantum game Nash equilibria are proposed.
In cognitive psychology, some experiments of games were reported [1, 2, 3, 4], and these demonstrated that real players did not use the "rational strategy" provided by classical game theory. To discuss probabilities of such "irrational choice", recently, we proposed a decision-making model which is based on the formalism of quantum mechanics [5, 6, 7, 8]. In this paper, we briefly explain the above model and calculate the probability of irrational choice in several prisoner's dilemma (PD) games.
Classic game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the Prisoner's Dilemma (PD), have attracted a lot of attention. Similarly, state machines and specifically finite automata have also been under constant and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the quantum finite automata, have been studied extensively. In this work, we examine some well-known game conditional strategies that have been studied within the framework of the repeated PD game. Then, we try to associate these strategies to proper quantum finite automata that receive them as inputs and recognize them with probability 1, achieving some interesting results. We also study the quantum version of PD under the Eisert-Wilkens-Lewenstein scheme, proposing a novel conditional strategy for the repeated version of this game.