Constructing quantum games from symmetric non-factorizable joint probabilities

From MaRDI portal
Publication:418474

DOI10.1016/J.PHYSLETA.2010.08.024zbMATH Open1238.81046arXiv1005.5262OpenAlexW2020470569WikidataQ62044592 ScholiaQ62044592MaRDI QIDQ418474FDOQ418474

James M. Chappell, Derek Abbott, Azhar Iqbal

Publication date: 29 May 2012

Published in: Physics Letters. A (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1005.5262




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Constructing quantum games from symmetric non-factorizable joint probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418474)