We give a self contained introduction to a few quantum game protocols, starting with the quantum version of the two-player two-choice game of Prisoners dilemma, followed by a n-player generalization trough the quantum minority games, and finishing with a contribution towards a n-player m-choice generalization with a quantum version of a three-player Kolkata restaurant problem. We have omitted some technical details accompanying these protocols, and instead laid the focus on presenting some general aspects of the field as a whole. This review contains an introduction to the formalism of quantum information theory, as well as to important game theoretical concepts, and is aimed to work as an introduction suiting economists and game theorists with limited knowledge of quantum physics as well as to physicists with limited knowledge of game theory.We give a self contained introduction to a few quantum game protocols, starting with the quantum version of the two-player two-choice game of Prisoners dilemma, followed by a n-player generalization trough the quantum minority games, and finishing with a contribution towards a n-player m-choice generalization with a quantum version of a three-player Kolkata restaurant problem. We have omitted some technical details accompanying these protocols, and instead laid the focus on presenting some general aspects of the field as a whole. This review contains an introduction to the formalism of quantum information theory, as well as to important game theoretical concepts, and is aimed to work as an introduction suiting economists and game theorists with limited knowledge of quantum physics as well as to physicists with limited knowledge of game theory.

arXiv:1204.0661Apr 3, 20122 citations

Quantum solution to a three player Kolkata restaurant problem using entangled qutrits

Puya Sharif, Hoshang Heydari

Three player quantum Kolkata restaurant problem is modelled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a $N$ -choice generalization of the $N$ -player quantum minority game. It is shown that a better than classical payoff is achieved by a Nash equilibrium solution where the space of available strategies is spanned by subsets of SU(3) and the players share a tripartite entangled initial state.Three player quantum Kolkata restaurant problem is modelled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a $N$-choice generalization of the $N$-player quantum minority game. It is shown that a better than classical payoff is achieved by a Nash equilibrium solution where the space of available strategies is spanned by subsets of SU(3) and the players share a tripartite entangled initial state.

arXiv:1111.1962Quantum Information and ComputationMar 1, 20145 citations

A survey of quantum games

Hong Mei Guo, Juheng Zhang, Gary J. Kœhler

Decision Support SystemsJul 11, 2008147 citations

Three player quantum Kolkata restaurant problem is modelled using three entangled qutrits. This first use of three level quantum states in this context is a step towards a

N

-choice generalization of the

N

-player quantum minority game. It is shown that a better than classical payoff is achieved by a Nash equilibrium solution where the space of available strategies is spanned by subsets of SU(3) and the players share a tripartite entangled initial state.