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

arXiv:quant-ph/0311074

Samaritan's Dilemma: Classical and quantum strategies in Welfare Game

Şahin Kaya Özdemir, Junichi Shimamura, Fumiaki Morikoshi, Nobuyuki Imoto

Published Nov 12, 2003• 0 citations
arXivHTMLPDF

Abstract

Effects of classical/quantum correlations and operations in game theory are analyzed using Samaritan's Dilemma. We observe that introducing either quantum or classical correlations to the game results in the emergence of a unique or multiple Nash equilibria (NE) which do not exist in the original classical game. It is shown that the strategies creating the NE and the amount of payoffs the players receive at these NE's depend on the type of the correlation. We also discuss whether the Samaritan can resolve the dilemma acting unilaterally.

DOI
10.48550/arxiv.quant-ph/0311074

Related papers

Samaritan's Dilemma: Classical and quantum strategies in Welfare Game

S Kaya, Junichi Shimamura, Fumiaki Morikoshi +2 more

Effects of classical/quantum correlations and operations in game theory are analyzed using Samar- itan's Dilemma. We observe that introducing either quantum or classical correlations to the game results in the emergence of a unique or multiple Nash equilibria (NE) which do not exist in the original classical game. It is shown that the strategies creating the NE and the amount of payoffs the players receive at these NE's depend on the type of the correlation. We also discuss whether the Samaritan can resolve the dilemma acting unilaterally. PACS numbers: 03.67.-a, 02.50.Le (α, β) where α ∈ SA and β ∈ SB can be written as uA(α, β). In classical game theory, any game is fully described by its payoff matrix. Based on the nature of payoffs, games can be classified in three different ways (i) symmetric, uA(α, β) = uB(β, α), and asymmetric games, uA(α, β) 6 uB(β, α), (ii) zero-sum, uA(α, β)+uB(α, β) = 0 for ∀α ∈ SA, and non-zero sum games, if for ∃α ∈ SA and ∃β ∈ SB, uA(α, β) + uB(α, β) 6 0 , and (iii) coor- dination if the game has at least one Nash equilibrium (NE), and discoordination games if there is no NE in pure strategies (15). Nash equilibrium is the most commonly used equilib- rium concept for strategic games, and it can be regarded as the steady state of the strategic interaction. The con- cept of NE is based on the premises that each player acts rationally according to the belief he/she has on the other player, and that the beliefs of each player about the other one is correct. Once the players acts according to NE, no one can take another action to unilaterally deviate from it in order to increase his/her payoff. In an NE, each player's choice of action is the best response to the ac- tions taken by the other player. Although in pure strate- gies an NE need not exist, there is always at least one NE in mixed strategies where the players are allowed to ran- domize among their action. The most common difficulty encountered in the concept of NE is that NE need not be unique. There might be multiple NE's which avoids making sharp decisions. In such cases, certain NE's can be isolated as focal in that they are clearly better for all players, and they yield a higher payoff to every player than any other NE's. If there exists only one NE like this, then players will be self-enforced to play it, thus solving

•Nov 12, 2003•2 citations

Quantum volunteer's dilemma

Dax Enshan Koh, Kaavya Kumar, Siong Thye Goh

The volunteer's dilemma is a well-known game in game theory that models the conflict players face when deciding whether to volunteer for a collective benefit, knowing that volunteering incurs a personal cost. In this work we introduce a quantum variant of the classical volunteer's dilemma, generalizing it by allowing players to utilize quantum strategies. Employing the Eisert-Wilkens-Lewenstein quantization framework, we analyze a multiplayer quantum volunteer's dilemma scenario with an arbitrary number of players, where the cost of volunteering is shared equally among the volunteers. We derive analytical expressions for the players' expected payoffs and demonstrate the quantum game's advantage over the classical game. In particular, we prove that the quantum volunteer's dilemma possesses symmetric Nash equilibria with larger expected payoffs compared to the unique symmetric Nash equilibrium of the classical game, wherein players use mixed strategies. Furthermore, we show that the quantum Nash equilibria we identify are Pareto optimal. Our findings reveal distinct dynamics in volunteer's dilemma scenarios when players adhere to quantum rules, underscoring a strategic advantage of decision making in quantum settings.

arXiv:2409.05708•Physical Review Research•Jan 27, 2025•10 citations

Nash equilibria in four-strategy quantum game extensions of the Prisoner's Dilemma

Piotr Frąckiewicz, Anna Gorczyca–Goraj, Krzysztof Grzegorz Grzanka +2 more

This paper investigates Nash equilibria in pure strategies for quantum approach to the Prisoner's Dilemma. The quantization process involves extending the classical game by introducing two additional unitary strategies. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. For each class, we identify and analyse all possible Nash equilibria. Our results reveal the complexity and diversity of strategic behaviour in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In the case of the standard Prisoner's Dilemma, the resulting Nash equilibria of quantum extensions are found to be closer to Pareto optimal solutions than those of the classical equilibrium.

arXiv:2411.01711•Nov 3, 2024•0 citations

Efficiency of Classical and Quantum Games Equilibria

M. Szopa

Nash equilibria and correlated equilibria of classical and quantum games are investigated in the context of their Pareto efficiency. The examples of the prisoner's dilemma, battle of the sexes and the game of chicken are studied. Correlated equilibria usually improve Nash equilibria of games but require a trusted correlation device susceptible to manipulation. The quantum extension of these games in the Eisert-Wilkens-Lewenstein formalism and the Frąckiewicz-Pykacz parameterization is analyzed. It is shown that the Nash equilibria of these games in quantum mixed Pauli strategies are closer to Pareto optimal results than their classical counter-parts. The relationship of mixed Pauli strategies equilibria and correlated equilibria is also studied.

Entropy•Apr 22, 2021•21 citations

On Correlated Equilibria in Marinatto–Weber Type Quantum Games

Piotr Frąckiewicz

Players’ choices in quantum game schemes are often correlated by a quantum state. This enables players to obtain payoffs that may not be achievable when classical pure or mixed strategies are used. On the other hand, players’ choices can be correlated due to a classical probability distribution, and if no player benefits by a unilateral deviation from the vector of recommended strategies, the probability distribution is a correlated equilibrium. The aim of this paper is to investigate relation between correlated equilibria and Nash equilibria in the MW-type schemes for quantum games.

Applied Sciences•Dec 16, 2020•0 citations

Nash Equilibria in Four-Strategy Quantum Extensions of the Prisoner’s Dilemma Game

Piotr Frąckiewicz, Anna Gorczyca–Goraj, Krzysztof Grzegorz Grzanka +2 more

The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.

Entropy•Jul 15, 2025•2 citations
Effects of classical/quantum correlations and operations in game theory are analyzed using Samaritan's Dilemma. We observe that introducing either quantum or classical correlations to the game results in the emergence of a unique or multiple Nash equilibria (NE) which do not exist in the original classical game. It is shown that the strategies creating the NE and the amount of payoffs the players receive at these NE's depend on the type of the correlation. We also discuss whether the Samaritan can resolve the dilemma acting unilaterally.
Effects of classical/quantum correlations and operations in game theory are analyzed using Samar- itan's Dilemma. We observe that introducing either quantum or classical correlations to the game results in the emergence of a unique or multiple Nash equilibria (NE) which do not exist in the original classical game. It is shown that the strategies creating the NE and the amount of payoffs the players receive at these NE's depend on the type of the correlation. We also discuss whether the Samaritan can resolve the dilemma acting unilaterally. PACS numbers: 03.67.-a, 02.50.Le (α, β) where α ∈ SA and β ∈ SB can be written as uA(α, β). In classical game theory, any game is fully described by its payoff matrix. Based on the nature of payoffs, games can be classified in three different ways (i) symmetric, uA(α, β) = uB(β, α), and asymmetric games, uA(α, β) 6 uB(β, α), (ii) zero-sum, uA(α, β)+uB(α, β) = 0 for ∀α ∈ SA, and non-zero sum games, if for ∃α ∈ SA and ∃β ∈ SB, uA(α, β) + uB(α, β) 6 0 , and (iii) coor- dination if the game has at least one Nash equilibrium (NE), and discoordination games if there is no NE in pure strategies (15). Nash equilibrium is the most commonly used equilib- rium concept for strategic games, and it can be regarded as the steady state of the strategic interaction. The con- cept of NE is based on the premises that each player acts rationally according to the belief he/she has on the other player, and that the beliefs of each player about the other one is correct. Once the players acts according to NE, no one can take another action to unilaterally deviate from it in order to increase his/her payoff. In an NE, each player's choice of action is the best response to the ac- tions taken by the other player. Although in pure strate- gies an NE need not exist, there is always at least one NE in mixed strategies where the players are allowed to ran- domize among their action. The most common difficulty encountered in the concept of NE is that NE need not be unique. There might be multiple NE's which avoids making sharp decisions. In such cases, certain NE's can be isolated as focal in that they are clearly better for all players, and they yield a higher payoff to every player than any other NE's. If there exists only one NE like this, then players will be self-enforced to play it, thus solving
The volunteer's dilemma is a well-known game in game theory that models the conflict players face when deciding whether to volunteer for a collective benefit, knowing that volunteering incurs a personal cost. In this work we introduce a quantum variant of the classical volunteer's dilemma, generalizing it by allowing players to utilize quantum strategies. Employing the Eisert-Wilkens-Lewenstein quantization framework, we analyze a multiplayer quantum volunteer's dilemma scenario with an arbitrary number of players, where the cost of volunteering is shared equally among the volunteers. We derive analytical expressions for the players' expected payoffs and demonstrate the quantum game's advantage over the classical game. In particular, we prove that the quantum volunteer's dilemma possesses symmetric Nash equilibria with larger expected payoffs compared to the unique symmetric Nash equilibrium of the classical game, wherein players use mixed strategies. Furthermore, we show that the quantum Nash equilibria we identify are Pareto optimal. Our findings reveal distinct dynamics in volunteer's dilemma scenarios when players adhere to quantum rules, underscoring a strategic advantage of decision making in quantum settings.
This paper investigates Nash equilibria in pure strategies for quantum approach to the Prisoner's Dilemma. The quantization process involves extending the classical game by introducing two additional unitary strategies. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. For each class, we identify and analyse all possible Nash equilibria. Our results reveal the complexity and diversity of strategic behaviour in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In the case of the standard Prisoner's Dilemma, the resulting Nash equilibria of quantum extensions are found to be closer to Pareto optimal solutions than those of the classical equilibrium.
Nash equilibria and correlated equilibria of classical and quantum games are investigated in the context of their Pareto efficiency. The examples of the prisoner's dilemma, battle of the sexes and the game of chicken are studied. Correlated equilibria usually improve Nash equilibria of games but require a trusted correlation device susceptible to manipulation. The quantum extension of these games in the Eisert-Wilkens-Lewenstein formalism and the Frąckiewicz-Pykacz parameterization is analyzed. It is shown that the Nash equilibria of these games in quantum mixed Pauli strategies are closer to Pareto optimal results than their classical counter-parts. The relationship of mixed Pauli strategies equilibria and correlated equilibria is also studied.
Players’ choices in quantum game schemes are often correlated by a quantum state. This enables players to obtain payoffs that may not be achievable when classical pure or mixed strategies are used. On the other hand, players’ choices can be correlated due to a classical probability distribution, and if no player benefits by a unilateral deviation from the vector of recommended strategies, the probability distribution is a correlated equilibrium. The aim of this paper is to investigate relation between correlated equilibria and Nash equilibria in the MW-type schemes for quantum games.
The concept of Nash equilibria in pure strategies for quantum extensions of the general form of the Prisoner's Dilemma game is investigated. The process of quantization involves incorporating two additional unitary strategies, which effectively expand the classical game. We consider five classes of such quantum games, which remain invariant under isomorphic transformations of the classical game. The resulting Nash equilibria are found to be more closely aligned with Pareto-optimal solutions than those of the conventional Nash equilibrium outcome of the classical game. Our results demonstrate the complexity and diversity of strategic behavior in the quantum setting, providing new insights into the dynamics of classical decision-making dilemmas. In particular, we provide a detailed characterization of strategy profiles and their corresponding Nash equilibria, thereby extending the understanding of quantum strategies' impact on traditional game-theoretical problems.