Abstract
We show that quantum games are more efficient than classical games and provide a saturated upper bound for this efficiency. We also demonstrate that the set of finite classical games is a strict subset of the set of finite quantum games. Our analysis is based on a rigorous formulation of quantum games, from which quantum versions of the minimax theorem and the Nash equilibrium theorem can be deduced.
- Received 2 August 2002
DOI:https://doi.org/10.1103/PhysRevA.67.022311
©2003 American Physical Society