Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/62237
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Journal article |
Title: | Constructing quantum games from symmetric non-factorizable joint probabilities |
Author: | Chappell, J. Iqbal, A. Abbott, D. |
Citation: | Physics Letters A: General Physics, Nonlinear Science, Statistical Physics, Atomic, Molecular and Cluster Physics, Plasma and Fluid Physics, Condensed Matter, Cross-disciplinary Physics, Biological Physics, Nanosciences, Quantum Physics, 2010; 374(40):4104-4111 |
Publisher: | Elsevier Science BV |
Issue Date: | 2010 |
ISSN: | 0375-9601 |
Statement of Responsibility: | James M. Chappell, Azhar Iqbal and Derek Abbott |
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. © 2010 Elsevier B.V. |
Keywords: | Quantum games Joint probability Quantum probability Nash equilibrium Non-factorizability Symmetric games |
Rights: | Copyright 2010 Elsevier B.V. All rights reserved. |
DOI: | 10.1016/j.physleta.2010.08.024 |
Description (link): | http://www.elsevier.com/wps/find/journaldescription.cws_home/505705/description#description |
Published version: | http://dx.doi.org/10.1016/j.physleta.2010.08.024 |
Appears in Collections: | Aurora harvest Electrical and Electronic Engineering publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.