Efficiency and formalism of quantum games
Abstract
Description
We pursue a general theory of quantum games. We show that quantum games are more efficient than classical games, and provide a saturated upper bound for this efficiency. We demonstrate that the set of finite classical games is a strict subset of the set of finite quantum games. We also deduce the quantum version of the Minimax Theorem and the Nash Equilibrium Theorem.
10 pages. Efficiency is explicitly defined. More discussion on the connection of quantum and classical games
10 pages. Efficiency is explicitly defined. More discussion on the connection of quantum and classical games