Nash Equilibria in Quantum Games
When the players in a game G can communicate with a referee via quantum technology (e.g. by sending emails composed on a quantum computer), their strategy sets naturally expand to include quantum superpositions of pure strategies. These superpositions lead to probability distributions among payoffs that would be impossible if players were restricted to classical mixed strategies. Thus the game G is replaced by a much larger “quantum game” GQ. When G is a 2 x 2 game, the strategy spaces of GQ are copies of the threedimensional sphere S3; therefore a mixed strategy is an arbitrary probability distribution on S3. These strategy spaces are so large that Nash equilibria can be difficult to compute or even to describe. The present paper largely overcomes this difficulty by classifying all mixed-strategy Nash equilibria in games of the form GQ. One result is that we can confine our attention to probability distributions supported on at most four points of S3; another is that these points must lie in one of several very restrictive geometric configurations. A stand-alone Appendix summarizes the relevant background from quantum mechanics and quantum game theory.
|Date of creation:||Feb 2006|
|Contact details of provider:|| Postal: University of Rochester, Center for Economic Research, Department of Economics, Harkness 231 Rochester, New York 14627 U.S.A.|
When requesting a correction, please mention this item's handle: RePEc:roc:rocher:524. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard DiSalvo)
If references are entirely missing, you can add them using this form.