Constructing quantum games from symmetric non-factorizable joint probabilities

Abstract

We construct quantum games from a table of non-factorizable joint probabilities, coupled with a symmetry constraint, requiring symmetrical payoffs between the players. We give the general result for a Nash equilibrium and payoff relations for a game based on non-factorizable joint probabilities, which embeds the classical game. We study a quantum version of Prisoners' Dilemma, Stag Hunt, and the Chicken game constructed from a given table of non-factorizable joint probabilities to find new outcomes in these games. We show that this approach provides a general framework for both classical and quantum games without recourse to the formalism of quantum mechanics.

20 pages, no figure, accepted for publication in Physics Letters A

References in corpus (8)

• Nash equilibria in quantum games with generalized two-parameter strategies
• A necessary and sufficient condition to play games in quantum mechanical settings
• Probabilistic analysis of three-player symmetric quantum games played using the Einstein-Podolsky-Rosen-Bohm setting
• Constructing quantum games from non-factorizable joint probabilities
• Duality, Phase Structures and Dilemmas in Symmetric Quantum Games
• An Analysis of the Quantum Penny Flip Game using Geometric Algebra
• Quantum Matching Pennies Game
• Constructing multi-player quantum games from non-factorizable joint probabilities

Cited by in corpus (7)

• N-player quantum games in an EPR setting
• Analysis of two-player quantum games in an EPR setting using geometric algebra
• Quantum version of a generalized Monty Hall game and its possible applications to quantum secure communications
• Two-player quantum games: When player strategies are via directional choices
• A game theoretical perspective on the quantum probabilities associated with a GHZ state
• On the equivalence between non-factorizable mixed-strategy classical games and quantum games
• Social optimality in quantum Bayesian games