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

arXiv:0908.4373 · Physics Letters A

A competitive game whose maximal Nash-equilibrium payoff requires quantum resources for its achievement

Charles D. Hill, Adrian P. Flitney, Nicolas C. Menicucci

Published Jul 11, 2010• 13 citations
arXivHTMLPDF
DOI
10.1016/j.physleta.2010.07.010

Related papers

Multiplayer quantum minority game with decoherence

Adrian P. Flitney, Lloyd C. L. Hollenberg

A quantum version of the Minority game for an arbitrary number of agents is considered. It is known that when the number of agents is odd, quantizing the game produces no advantage to the players, but for an even number of agents new Nash equilibria appear that have no classical analogue and have improved payoffs. We study the effect on the Nash equilibrium payoff of various forms of decoherence. As the number of players increases the multipartite GHZ state becomes increasingly fragile, as indicated by the smaller error probability required to reduce the Nash equilibrium payoff to the classical level.

Quantum Information and Computation•Jan 1, 2007•35 citations

Nash equilibria in quantum games with generalized two-parameter strategies

Adrian P. Flitney, Lloyd C. L. Hollenberg

arXiv:quant-ph/0610084•Physics Letters A•Nov 28, 2006•91 citations

A Unique Mixed Equilibrium Payoff in Quantum Bimatrix Games

Lonnie Turpin

Journal of Optimization Theory and Applications•Feb 15, 2023•0 citations

Some Topics in Quantum Games

Y. Avishai

This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown 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. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.

arXiv:1306.0284•Jun 3, 2013•14 citations

Quantization of the stag hunt game and the Nash equilibrilum

Norihito Toyota

In this paper I quantize the stag hunt game in the framework proposed by Marinatto and Weber which, is introduced to quantize the Battle of the Sexes game and gives a general quntization scheme of various game theories. Then I discuss the Nash equibilium solution in the cases of which starting strategies are taken in both non entangled state and entangled state and uncover the structure of Nash Equilibrium solutions and compare the case of the Battle of the Sexes game. Since the game has 4 parameters in the payoff matrix has rather rich structure than the Battle of the Sexes game with 3-parameters in the payoff matrix, the relations of the magnitude of these payoff values in Nash Equilibriums are much involuved. This structure is uncovered completly and it is found that the best strategy which give the maximal sum of the payoffs of both players strongly depends on the initial quntum state. As the bonus of the formulation the stag hunt game with four parameters we can discuss various types of symmetric games played by two players by using the latter formulation, i.e. Chicken game. As result some common properties are found between them and the stag hunt game. Lastly a little remark is made on Prisoner's Dillemma.

arXiv:quant-ph/0307029•Jul 4, 2003•9 citations

Quantum Nash Equilibria and Quantum Computing

Philip V. Fellman, Jonathan Vos Post

arXiv:0707.0324•Springer eBooks•Jan 1, 2010•3 citations
A quantum version of the Minority game for an arbitrary number of agents is considered. It is known that when the number of agents is odd, quantizing the game produces no advantage to the players, but for an even number of agents new Nash equilibria appear that have no classical analogue and have improved payoffs. We study the effect on the Nash equilibrium payoff of various forms of decoherence. As the number of players increases the multipartite GHZ state becomes increasingly fragile, as indicated by the smaller error probability required to reduce the Nash equilibrium payoff to the classical level.
This work, based on the author's MA thesis, concentrates on simultaneous move quantum games of two players. A numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games is constructed. It is then used show that there is a critical degree of entanglement above which a pure strategy Nash Equilibrium does not exist. The behavior of the two payoffs approach the cooperative classical ones. Bayesian quantum games are defined, and it is shown that under certain conditions, there {\it is} a pure strategy Nash equilibrium in such games even when entanglement is maximal. The basic ingredients of a quantum game based on a two-players {\it three} decisions classical games are presented. This requires the definition of trits (instead of bits) and quantum trits (instead of quantum bits). It is shown 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. An entanglement operator transforming a pure two qutrit state into a maximally entangled one is explicitly constructed.
In this paper I quantize the stag hunt game in the framework proposed by Marinatto and Weber which, is introduced to quantize the Battle of the Sexes game and gives a general quntization scheme of various game theories. Then I discuss the Nash equibilium solution in the cases of which starting strategies are taken in both non entangled state and entangled state and uncover the structure of Nash Equilibrium solutions and compare the case of the Battle of the Sexes game. Since the game has 4 parameters in the payoff matrix has rather rich structure than the Battle of the Sexes game with 3-parameters in the payoff matrix, the relations of the magnitude of these payoff values in Nash Equilibriums are much involuved. This structure is uncovered completly and it is found that the best strategy which give the maximal sum of the payoffs of both players strongly depends on the initial quntum state. As the bonus of the formulation the stag hunt game with four parameters we can discuss various types of symmetric games played by two players by using the latter formulation, i.e. Chicken game. As result some common properties are found between them and the stag hunt game. Lastly a little remark is made on Prisoner's Dillemma.