Quantum Strategies

Publisher Website
Google Scholar
Abstract
We consider game theory from the perspective of quantum algorithms. Strategies in classical game theory are either pure (deterministic) or mixed (probabilistic). While not every two-person zero-sum finite game has an equilibrium in the set of pure strategies, von Neumann showed that there is always an equilibrium at which each player follows a mixed strategy. A mixed strategy deviating from the equilibrium strategy cannot increase a player's expected payoff. We show by example, however, that a player who implements a quantum strategy can increase his expected payoff, and explain the relation to efficient quantum algorithms.
All Related Versions

This publication has 15 references indexed in Scilit: