arXiv:quant-ph/0608131

New models of quantum games

Paulo Benicio Melo de Sousa, Rubens Viana Ramos, Jose Tarcisio Costa filho

Published Aug 17, 2006• 6 citations

Abstract

In this work we propose and develop modified quantum games (zero and non-zero sum) in which payoffs and strategies are entangled. For the games studied, Nash and Pareto equilibriums are always obtained indicating that there are some interesting cases where quantum games can be applied.

DOI: 10.48550/arxiv.quant-ph/0608131

Related papers

On Topics in Quantum Games

Y. Avishai

This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.

Journal of Quantum Information ScienceJan 1, 20239 citations

QUANTUM GAME WITH INCOMPLETE INFORMATION

Yong‐Jian Han, Yong-Sheng Zhang, Guang‐Can Guo

Quantum game is an interesting field and many scientists have done a lot of innovative work in it. We give a quantum model about incomplete information. In this model we find whether the pure-strategy Bayes-Nash equilibrium exists or not is strongly dependent on the entanglement of the initial state. We also find the player Bob can always find an initial state and a pure-strategy Bayes-Nash equilibrium to get more payoff than classical game with some parameter.

Fluctuation and Noise LettersDec 1, 20023 citations

Generalized Quantum Games with Nash Equilibrium

Liu, X. F., Sun, C. P.

We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and two entangled qubit system. The Nash Equilibrium Theorem is proved for the models.

arXiv:quant-ph/0212045Dec 8, 20022 citations

Generalized Quantum Games with Nash Equilibrium

Xufeng Liu

We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it. The scheme is implemented with a single spin qubit system and a two-entangled-qubit system. The Nash Equilibrium Theorem is proved for the models.

Communications in Theoretical PhysicsApr 15, 20040 citations

Generalized Quantum Games with Nash Equilibrium

LIUXu-Feng

We define generalized quantum games by introducing the coherent payoff operators and propose a simple scheme to illustrate it.The scheme is implemented with a single spin qubit system and a two-entangled-qubit system.The Nash Equilibrium Theorem is proved for the models.

理论物理通讯：英文版Jan 1, 20040 citations

Quantum game theory

Michael L. Stohler

Non-cooperative quantum games have received much attention recently. This thesis defines and divides current works into two major categories of gaming techniques with close attention paid to Nash equilibria, form and possibilities for the payoff functions, and the benefits of using a quantum strategy. In addition to comparing and contrasting these techniques, new applications and calculations are discussed. Finally, the techniques are expanded into 3 x 3 games which allows the study of non-transitive strategies in quantum games.

Jan 1, 20020 citations