Formulation and Analysis of Quantum Games: A Mathematical Paradigm

Azhar Iqbal, James M. Chappell, Derek Abbott

A game-theoretic setting provides a mathematical basis for analysis of strategic interaction among competing agents and provides insights into both classical and quantum decision theory and questions of strategic choice. An outstanding mathematical question is to understand the conditions under which a classical game-theoretic setting can be transformed to a quantum game, and under which conditions there is an equivalence. In this paper, we consider quantum games as those that allow non-factorizable probabilities. We discuss two approaches for obtaining a non-factorizable game and study the outcome of such games. We demonstrate how the standard version of a quantum game can be analysed as a non-factorizable game and determine the limitations of our approach.

Indranil Ghosh

Indranil Ghosh

Chiu Fan Lee, Neil F. Johnson

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.

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

Simo Sun, Yadong Shu, Jinxiu Pi +1 more

We construct a repeated quantum game with public goods by the quantum entanglement and strong reciprocity. By using the paradigm of quantum game analysis, we obtain that both the quantum entanglement and strong reciprocity are helpful to intensify cooperation and achieving Pareto optimality. In addition, under an example which is greenhouse green viable planting industry, we verify that the quantum entanglement and strong reciprocity have a positive role in cooperation.