Mathematics – Optimization and Control
Scientific paper
2011-10-06
Proceedings of the American Mathematical Society 139 (2011), 4423-4434
Mathematics
Optimization and Control
Scientific paper
For any two-by-two game $\G$, we define a new two-player game $\G^Q$. The definition is motivated by a vision of players in game $\G$ communicating via quantum technology according to a certain standard protocol originally introduced by Eisert and Wilkins [EW]. In the game $\G^Q$, each players' strategy set consists of the set of all probability distributions on the 3-sphere $S^3$. Nash equilibria in this game can be difficult to compute. Our main theorems classify all possible equilibria in $\G^Q$ for a Zariski-dense set of games $\G$ that we call {\it generic games}. First, we show that up to a suitable definition of equivalence, any strategy that arises in equilibrium is supported on at most four points; then we show that those four points must lie in one of a small number of geometric configurations. One easy consequence is that for zero-sum games, the payoff to either player in a mixed strategy quantum equilibrium must equal the average of that player's four possible payoffs.
No associations
LandOfFree
Nash Equilibria in Quantum Games does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Nash Equilibria in Quantum Games, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nash Equilibria in Quantum Games will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-182211