On the equivalence between non-factorizable mixed-strategy classical games and quantum games
arXiv:1409.4878
Abstract
A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding mathematical question, is to understand the conditions under which a classical game-theoretic setting can be transformed to a quantum game, and under which conditions there is an equivalence. In this paper, we consider quantum games as those that allow non-factorizable probabilities. We discuss two approaches for obtaining a non-factorizable game and study the outcome of such games. We demonstrate how the standard version of a quantum game can be analyzed as a non-factorizable game and determine the limitations of our approach.
Revised, 15 pages
References in corpus (15)
- Bell nonlocality and Bayesian game theory
- Nash equilibria in quantum games with generalized two-parameter strategies
- Experimental realization of a quantum game on a one-way quantum computer
- A necessary and sufficient condition to play games in quantum mechanical settings
- Quantum advantages in classically defined tasks
- 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
- Cooperative quantum Parrondo's games
- Coalitions in the quantum Minority game: classical cheats and quantum bullies
- A Formalism for Quantum Games and an Application
- N-player quantum games in an EPR setting
- Game-theoretic characterization of antidegradable channels
- Quantum games and social norms. The quantum ultimatum game
- Quantum games via search algorithms