Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Asian Journal of Economics and Banking

Quantum-like modelling in game theory: Quo Vadis? A brief review

Sudip Patra, Partha Ghose

Published Dec 3, 2020• 4 citations
Publisher

Abstract

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.

DOI
10.1108/ajeb-08-2020-0054

Related papers

How Quantum Prisoner’s Dilemma Can Support Negotiations

M. Szopa

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.

Optimum Economic Studies•Jan 1, 2014•7 citations

On Topics in Quantum Games

Y. Avishai

This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.

Journal of Quantum Information Science•Jan 1, 2023•9 citations

Nash Equilibria in Four-Strategy Quantum Extensions of the Prisoner’s Dilemma Game

Piotr Frąckiewicz, Anna Gorczyca–Goraj, Krzysztof Grzegorz Grzanka +2 more

The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.

arXiv:2411.01711•Entropy•Jul 15, 2025•3 citations

Quantum Game Theory

Huilin Zhao

Since the establishment of von Neumann and Nash's concept of equilibrium, game theory has become a universal language in economics and social sciences. However, classical game theory is deeply rooted in the mechanistic worldview, and its deterministic assumptions, static equilibrium, and individualistic methodology are becoming increasingly inadequate in explaining the emergence of cooperation, uncertainty, and complex social interactions. This book directly faces this dilemma and introduces the core concepts of quantum mechanics into game analysis, constructing a complete system of quantum game theory. Starting from the century long evolution of game theory, the entire book deeply criticizes the mechanistic nature of classical game theory, and re establishes the philosophical foundation of game theory through practical ontology. On this basis, this book proposes the hypothesis of a "quantum gamer" and constructs a complete analytical framework from superposition strategy space, quantum entanglement to measurement collapse. The system reconstructs core areas such as quantum zero sum games, quantum non-zero sum games, quantum prisoner's dilemma, quantum coordination games, quantum evolutionary games, quantum cooperative games, and quantum incomplete information games, and extends them to cutting-edge directions such as quantum repetitive games, quantum game learning, and quantum mechanism design. At the application level, this book comprehensively demonstrates the broad prospects of quantum game theory in fields such as economics, political science, sociology, biology, computer science, quantum computing, artificial intelligence, and ethics. This book emphasizes that quantum entanglement enables cooperation to emerge, and quantum measurement leads equilibrium from static to dynamic collapse, thus surpassing the explanatory boundaries of classical game theory. The book has a rigorous structure and in-depth arguments, combining theoretical originality with interdisciplinary perspectives, providing a groundbreaking work for researchers, graduate students, and cutting-edge explorers to understand the quantum game revolution.

•Sep 3, 2026•0 citations

An Investigation of Quantum Computational Game Theory

Scott Ricketts, Max Mintz

Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what

•Jan 1, 2006•0 citations

A Formalism for Quantum Games and an Application

Steven A. Bleiler

This paper presents a new mathematical formalism that describes the quantization of games. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. What has clouded many of the issues is the lack of a mathematical formalism for the subject in which these various issues can be clearly and precisely expressed, and which provides a context in which to present their resolution. Such a formalism is presented here, along with proposed resolutions to some of the issues discussed in the literature. One in particular, the question of whether there can exist equilibria in a quantized version of a game that do not correspond to classical correlated equilibria of that game and also deliver better payoffs than the classical correlated equilibria is answered in the affirmative for the Prisoner's Dilemma and Simplified Poker.

arXiv:0808.1389•Aug 10, 2008•33 citations
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.
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.
This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.
The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.
Since the establishment of von Neumann and Nash's concept of equilibrium, game theory has become a universal language in economics and social sciences. However, classical game theory is deeply rooted in the mechanistic worldview, and its deterministic assumptions, static equilibrium, and individualistic methodology are becoming increasingly inadequate in explaining the emergence of cooperation, uncertainty, and complex social interactions. This book directly faces this dilemma and introduces the core concepts of quantum mechanics into game analysis, constructing a complete system of quantum game theory. Starting from the century long evolution of game theory, the entire book deeply criticizes the mechanistic nature of classical game theory, and re establishes the philosophical foundation of game theory through practical ontology. On this basis, this book proposes the hypothesis of a "quantum gamer" and constructs a complete analytical framework from superposition strategy space, quantum entanglement to measurement collapse. The system reconstructs core areas such as quantum zero sum games, quantum non-zero sum games, quantum prisoner's dilemma, quantum coordination games, quantum evolutionary games, quantum cooperative games, and quantum incomplete information games, and extends them to cutting-edge directions such as quantum repetitive games, quantum game learning, and quantum mechanism design. At the application level, this book comprehensively demonstrates the broad prospects of quantum game theory in fields such as economics, political science, sociology, biology, computer science, quantum computing, artificial intelligence, and ethics. This book emphasizes that quantum entanglement enables cooperation to emerge, and quantum measurement leads equilibrium from static to dynamic collapse, thus surpassing the explanatory boundaries of classical game theory. The book has a rigorous structure and in-depth arguments, combining theoretical originality with interdisciplinary perspectives, providing a groundbreaking work for researchers, graduate students, and cutting-edge explorers to understand the quantum game revolution.
Game theory is a well established field with applications in many areas including the social sciences, biology, and computer science [6]. Recently, however, researchers in quantum computation have begun to study the implications of games set in the quantum domain (i.e. game theoretical situations where either one or more players have quantum computational power or where the implementation of strategies uses some form of quantum information). Such a setting allows for entanglement and superpositions of strategies and evaluation of payoffs using quantum measurement. This approach to game theory, according to some scholars in the field, could help us understand certain physical systems, improve economic markets, and develop quantum algorithms. I have conducted an investigation into quantum game theory. I have constructed simulation tools using Maple that, along with research into related work, have helped gain some insight into this new field. The important solutions in classical game theory are usually Nash equilibria. What do they look like in the quantum realm? In what
This paper presents a new mathematical formalism that describes the quantization of games. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999. The ensuing near decade has seen an explosion of contributions and controversy over what exactly a quantized game really is and if there is indeed anything new for game theory. What has clouded many of the issues is the lack of a mathematical formalism for the subject in which these various issues can be clearly and precisely expressed, and which provides a context in which to present their resolution. Such a formalism is presented here, along with proposed resolutions to some of the issues discussed in the literature. One in particular, the question of whether there can exist equilibria in a quantized version of a game that do not correspond to classical correlated equilibria of that game and also deliver better payoffs than the classical correlated equilibria is answered in the affirmative for the Prisoner's Dilemma and Simplified Poker.