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

British Journal of Mathematics & Computer Science

Equilibria in Quantum Three-Player Dilemma Game

Aden Ahmed

Published Jan 10, 2013• 2 citations
Publisher

Abstract

After a brief exploration of certain topological features of the unit octonions, we identify the Nash equilibria in a quantized version of three-player dilemma game using an octonionic representation of the payoff function. This representation is an important tool for the relative ease in working with octonionic arithmetic as opposed to multi-variant tensors and provides a fresh computational framework that can be utilized for the classification of Nash equilibria in generic three-player two-strategy games. While the full classification of equilibria remains a goal of future research, our representation has already established certain family of equilibria in a quantized version of three-player dilemma game.

DOI
10.9734/bjmcs/2013/2805

Related papers

OCTONIONIZATION OF THREE PLAYER, TWO STRATEGY MAXIMALLY ENTANGLED QUANTUM GAMES

ADEN OMAR AHMED, STEVEN A. BLEILER, FAISAL SHAH KHAN

We develop an octonionic representation of the payoff function for three player, two strategy, maximally entangled quantum games in order to obtain computationally friendly version of this function. This computational capability is then exploited to analyze and potentially classify the Nash equilibria in the quantum games.

arXiv:0808.1391•International Journal of Quantum Information•Apr 1, 2010•11 citations

Quaternions, Octonions, and the Quantization of Games

Aden Ahmed

We present an effect on classical games that is obtained by replacing the notion of probability distribution with the notions of quantum superposition and measurement. Our particular focus will be on two and three player games where each player has precisely two pure strategic choices. Games in normal form are represented as "payoff" functions. Game quantization requires the extension of these functions to much larger domains. The main result of this work is the co-ordinatization of these extended functions by either the quaternions or octonions in order to obtain computationally friendly versions of these functions. This computational capability is then exploited to analyze and potentially classify the Nash equilibria in the new extended games with occasionally counter intuitive results.

•Apr 20, 2009•1 citation

Characterizing the Nash equilibria of three-player Bayesian quantum games

Neal Solmeyer, Radhakrishnan Balu

Quantum games with incomplete information can be studied within a Bayesian framework. We analyze games quantized within the EWL framework [Eisert, Wilkens, and Lewenstein, Phys Rev. Lett. 83, 3077 (1999)]. We solve for the Nash equilibria of a variety of two-player quantum games and compare the results to the solutions of the corresponding classical games. We then analyze Bayesian games where there is uncertainty about the player types in two-player conflicting interest games. The solutions to the Bayesian games are found to have a phase diagram-like structure where different equilibria exist in different parameter regions, depending both on the amount of uncertainty and the degree of entanglement. We find that in games where a Pareto-optimal solution is not a Nash equilibrium, it is possible for the quantized game to have an advantage over the classical version. In addition, we analyze the behavior of the solutions as the strategy choices approach an unrestricted operation. We find that some games have a continuum of solutions, bounded by the solutions of a simpler restricted game. A deeper understanding of Bayesian quantum game theory could lead to novel quantum applications in a multi-agent setting.

arXiv:1703.03292•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 5, 2017•6 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

A periodic point-based method for the analysis of Nash equilibria in 2 × 2 symmetric quantum games

David M. Schneider

We present a novel method of looking at Nash equilibria in 2 × 2 quantum games. Our method is based on a mathematical connection between the problem of identifying Nash equilibria in game theory, and the topological problem of the periodic points in nonlinear maps. To adapt our method to the original protocol designed by Eisert et al (1999 Phys. Rev. Lett. 83 3077–80) to study quantum games, we are forced to extend the space of strategies from the initial proposal. We apply our method to the extended strategy space version of the quantum Prisoner's dilemma and find that a new set of Nash equilibria emerge in a natural way. Nash equilibria in this set are optimal as Eisert's solution of the quantum Prisoner's dilemma and include this solution as a limit case.

Journal of Physics A Mathematical and Theoretical•Feb 9, 2011•7 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
After a brief exploration of certain topological features of the unit octonions, we identify the Nash equilibria in a quantized version of three-player dilemma game using an octonionic representation of the payoff function. This representation is an important tool for the relative ease in working with octonionic arithmetic as opposed to multi-variant tensors and provides a fresh computational framework that can be utilized for the classification of Nash equilibria in generic three-player two-strategy games. While the full classification of equilibria remains a goal of future research, our representation has already established certain family of equilibria in a quantized version of three-player dilemma game.
We present an effect on classical games that is obtained by replacing the notion of probability distribution with the notions of quantum superposition and measurement. Our particular focus will be on two and three player games where each player has precisely two pure strategic choices. Games in normal form are represented as "payoff" functions. Game quantization requires the extension of these functions to much larger domains. The main result of this work is the co-ordinatization of these extended functions by either the quaternions or octonions in order to obtain computationally friendly versions of these functions. This computational capability is then exploited to analyze and potentially classify the Nash equilibria in the new extended games with occasionally counter intuitive results.
Quantum games with incomplete information can be studied within a Bayesian framework. We analyze games quantized within the EWL framework [Eisert, Wilkens, and Lewenstein, Phys Rev. Lett. 83, 3077 (1999)]. We solve for the Nash equilibria of a variety of two-player quantum games and compare the results to the solutions of the corresponding classical games. We then analyze Bayesian games where there is uncertainty about the player types in two-player conflicting interest games. The solutions to the Bayesian games are found to have a phase diagram-like structure where different equilibria exist in different parameter regions, depending both on the amount of uncertainty and the degree of entanglement. We find that in games where a Pareto-optimal solution is not a Nash equilibrium, it is possible for the quantized game to have an advantage over the classical version. In addition, we analyze the behavior of the solutions as the strategy choices approach an unrestricted operation. We find that some games have a continuum of solutions, bounded by the solutions of a simpler restricted game. A deeper understanding of Bayesian quantum game theory could lead to novel quantum applications in a multi-agent setting.
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.
We present a novel method of looking at Nash equilibria in 2 × 2 quantum games. Our method is based on a mathematical connection between the problem of identifying Nash equilibria in game theory, and the topological problem of the periodic points in nonlinear maps. To adapt our method to the original protocol designed by Eisert et al (1999 Phys. Rev. Lett. 83 3077–80) to study quantum games, we are forced to extend the space of strategies from the initial proposal. We apply our method to the extended strategy space version of the quantum Prisoner's dilemma and find that a new set of Nash equilibria emerge in a natural way. Nash equilibria in this set are optimal as Eisert's solution of the quantum Prisoner's dilemma and include this solution as a limit case.
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