Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum repeated games

A. Iqbal, A. H. Toor

Published Mar 10, 2002• 35 citations
OpenAlex

Abstract

In a two-stage repeated classical game of prisoners' dilemma the knowledge that both players will defect in the second stage makes the players to defect in the first stage as well. We find a quantum version of this repeated game where the players decide to cooperate in the first stage while knowing that both will defect in the second.

Related papers

A quantum approach to twice-repeated $$2\times 2$$ game

Katarzyna Rycerz, Piotr Frąckiewicz

Abstract This work proposes an extension of the well-known Eisert–Wilkens–Lewenstein scheme for playing a twice repeated $$2\times 2$$ 2 × 2 game using a single quantum system with ten maximally entangled qubits. The proposed scheme is then applied to the Prisoner’s Dilemma game. Rational strategy profiles are examined in the presence of limited awareness of the players. In particular, the paper considers two cases of a classical player against a quantum player game: the first case when the classical player does not know that his opponent is a quantum one and the second case, when the classical player is aware of it. To this end, the notion of unawareness was used, and the extended Nash equilibria were determined.

Quantum Information Processing•Jul 29, 2020•6 citations

Repeated Quantum Games and Strategic Efficiency.

Shoto Aoki, Kazuki Ikeda

Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, only single round quantum games or at most finitely repeated games have been studied, therefore nothing is known for infinitely repeated quantum game. Investigating infinitely repeated games is crucial since finitely repeated games does not much differ from single round games. In this work we establish the concept of general repeated quantum games and show the Quantum Folk Theorem, which claims that by iterating a game one can find an equilibrium strategy of the game and receive reward that is not obtained by a Nash equilibrium of the corresponding single round quantum game. A significant difference between repeated quantum prisoner's dilemma and repeated classical prisoner's dilemma is that the classical Pareto optimal solution is not always an equilibrium of the repeated quantum game when entanglement is sufficiently strong. In addition we present several concrete equilibrium strategies of the repeated quantum prisoner's dilemma.

•May 12, 2020•3 citations

Quantum Game Theory

Zibo Wang

Game theory has wide implementation on many fields of study. With more recent development in quantum computation and quantum information, we are able to study games with rule of quantum mechanics. This paper consists two part: in first part, basic knowledge of game theory is briefly recalled, and prisoner’s dilemma is introduced; in second part, how quantum version game is differ from classical is discussed, and an analysis quantum version of prisoner’s dilemma is presented.

•Nov 1, 2019•0 citations

How Quantum Prisoner’s Dilemma Can Support Negotiations

M. Szopa

Decision-making by the two negotiating parties is simulated by a prisoner's dilemma game.The game is formulated in a quantum manner, where players strategies are unitary transformations of qubits built over the basis of opposite decision options.Quantum strategies are correlated through the mechanism of quantum entanglement and the result of the game is obtained by the collapse of the resulting transformed state.The range of strategies allowed for quantum players is richer than in case of a classical game and therefore the result of the game can be better optimized.On the other hand, the quantum game is save against eavesdropping and the players can be assured that this type of quantum arbitration is fair.We show that quantum prisoner's dilemma has more favorable Nash equilibria than its classical analog and they are close to the Pareto optimal solutions.Some economical examples of utilizing quantum game Nash equilibria are proposed.

Optimum Economic Studies•Jan 1, 2014•7 citations

Quantum-like dynamics of decision-making in prisoner's dilemma game

Masanari Asano, Irina Basieva, Andrei Yu. Khrennikov +2 more

In cognitive psychology, some experiments of games were reported [1, 2, 3, 4], and these demonstrated that real players did not use the "rational strategy" provided by classical game theory. To discuss probabilities of such "irrational choice", recently, we proposed a decision-making model which is based on the formalism of quantum mechanics [5, 6, 7, 8]. In this paper, we briefly explain the above model and calculate the probability of irrational choice in several prisoner's dilemma (PD) games.

AIP conference proceedings•Jan 1, 2012•9 citations

Quantum Conditional Strategies and Automata for Prisoners’ Dilemmata under the EWL Scheme

Konstantinos Giannakis, Georgia Theocharopoulou, Christos Papalitsas +2 more

Classical game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the prisoner’s dilemma (PD), have attracted a lot of attention. This game variant can be considered as a specific type of game where the player’s actions and strategies are formed using notions from quantum computation. Similarly, state machines, and specifically finite automata, have also been under constant and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the quantum finite automata, have been studied extensively. In this work, we examine well-known conditional strategies that have been studied within the framework of the classical repeated PD game. Then, we try to associate these strategies to proper quantum finite automata that receive them as inputs and recognize them with a probability of 1, achieving some interesting results. We also study the quantum version of PD under the Eisert–Wilkens–Lewenstein scheme, proposing a novel conditional strategy for the repeated version of this game.

Applied Sciences•Jun 28, 2019•24 citations
In a two-stage repeated classical game of prisoners' dilemma the knowledge that both players will defect in the second stage makes the players to defect in the first stage as well. We find a quantum version of this repeated game where the players decide to cooperate in the first stage while knowing that both will defect in the second.
A quantum approach to twice-repeated 2×22\times 22×2 game
Abstract This work proposes an extension of the well-known Eisert–Wilkens–Lewenstein scheme for playing a twice repeated 2×22\times 22×2 2 × 2 game using a single quantum system with ten maximally entangled qubits. The proposed scheme is then applied to the Prisoner’s Dilemma game. Rational strategy profiles are examined in the presence of limited awareness of the players. In particular, the paper considers two cases of a classical player against a quantum player game: the first case when the classical player does not know that his opponent is a quantum one and the second case, when the classical player is aware of it. To this end, the notion of unawareness was used, and the extended Nash equilibria were determined.
Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, only single round quantum games or at most finitely repeated games have been studied, therefore nothing is known for infinitely repeated quantum game. Investigating infinitely repeated games is crucial since finitely repeated games does not much differ from single round games. In this work we establish the concept of general repeated quantum games and show the Quantum Folk Theorem, which claims that by iterating a game one can find an equilibrium strategy of the game and receive reward that is not obtained by a Nash equilibrium of the corresponding single round quantum game. A significant difference between repeated quantum prisoner's dilemma and repeated classical prisoner's dilemma is that the classical Pareto optimal solution is not always an equilibrium of the repeated quantum game when entanglement is sufficiently strong. In addition we present several concrete equilibrium strategies of the repeated quantum prisoner's dilemma.
Decision-making by the two negotiating parties is simulated by a prisoner's dilemma game.The game is formulated in a quantum manner, where players strategies are unitary transformations of qubits built over the basis of opposite decision options.Quantum strategies are correlated through the mechanism of quantum entanglement and the result of the game is obtained by the collapse of the resulting transformed state.The range of strategies allowed for quantum players is richer than in case of a classical game and therefore the result of the game can be better optimized.On the other hand, the quantum game is save against eavesdropping and the players can be assured that this type of quantum arbitration is fair.We show that quantum prisoner's dilemma has more favorable Nash equilibria than its classical analog and they are close to the Pareto optimal solutions.Some economical examples of utilizing quantum game Nash equilibria are proposed.
In cognitive psychology, some experiments of games were reported [1, 2, 3, 4], and these demonstrated that real players did not use the "rational strategy" provided by classical game theory. To discuss probabilities of such "irrational choice", recently, we proposed a decision-making model which is based on the formalism of quantum mechanics [5, 6, 7, 8]. In this paper, we briefly explain the above model and calculate the probability of irrational choice in several prisoner's dilemma (PD) games.
Classical game theory is an important field with a long tradition of useful results. Recently, the quantum versions of classical games, such as the prisoner’s dilemma (PD), have attracted a lot of attention. This game variant can be considered as a specific type of game where the player’s actions and strategies are formed using notions from quantum computation. Similarly, state machines, and specifically finite automata, have also been under constant and thorough study for plenty of reasons. The quantum analogues of these abstract machines, like the quantum finite automata, have been studied extensively. In this work, we examine well-known conditional strategies that have been studied within the framework of the classical repeated PD game. Then, we try to associate these strategies to proper quantum finite automata that receive them as inputs and recognize them with a probability of 1, achieving some interesting results. We also study the quantum version of PD under the Eisert–Wilkens–Lewenstein scheme, proposing a novel conditional strategy for the repeated version of this game.