Quantum Volunteer's Dilemma

• URL: http://arxiv.org/abs/2409.05708v1
• Date: Mon, 9 Sep 2024 15:19:41 GMT
• Title: Quantum Volunteer's Dilemma
• Abstract summary: We introduce a quantum variant of the classical volunteer's dilemma. We show that the quantum volunteer's dilemma possesses symmetric Nash equilibria with larger expected payoffs. Our findings reveal distinct dynamics in volunteer's dilemma scenarios when players adhere to quantum rules.
• Score: 0.210674772139335
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quantum non-local games: Quantum relations, projection lattices and rule operators [51.56484100374058]
  (mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.<n>(mathcal R)-projection-test quantum games with finite-dimensional input and output von Neumann algebras.
  arXiv  Detail & Related papers  (2026-08-31T09:41:14Z)
• Parametric Open Source Games [78.29352305480285]
  We introduce parametric open-source games, a continuous analogue of program equilibria.<n>We derive an exact coupling threshold at which selfish gradient ascent in symmetric $2times2$ games switches from defection toward cooperation.<n>We extend the framework to a neural semantics class whose first-order cooperation condition is governed by the ratio of cross-player to self-player sensitivity.
  arXiv  Detail & Related papers  (2026-06-25T14:14:24Z)
• Entanglement in the Quantum Volunteer's Dilemma [0.0]
  We study a quantum version of the Volunteer's Dilemma game theory.<n>We find that maximal entanglement is not required to sustain symmetric Nash equilibria.<n>This characterization is directly relevant for implementations on resource-constrained quantum devices.
  arXiv  Detail & Related papers  (2026-06-06T15:31:16Z)
• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• Nash equilibria in four-strategy quantum game extensions of the Prisoner's Dilemma [0.0]
  This paper investigates Nash equilibria in pure strategies for quantum approach to the Prisoner's Dilemma. For each class, we identify and analyse all possible Nash equilibria. Results reveal the complexity and diversity of strategic behaviour in the quantum setting.
  arXiv  Detail & Related papers  (2024-11-03T23:09:36Z)
• Determining Quantum Correlation through Nash Equilibria in Constant-Sum Games [0.0]
  Quantum game theory has emerged as a promising candidate to further the understanding of quantum correlations. Motivated by this, it is demonstrated that pure strategy Nash equilibria can be utilised as a mechanism to witness and determine quantum correlation.
  arXiv  Detail & Related papers  (2024-10-20T14:27:01Z)
• Imperfect-Recall Games: Equilibrium Concepts and Their Complexity [74.01381499760288]
  We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before. In the framework of extensive-form games with imperfect recall, we analyze the computational complexities of finding equilibria in multiplayer settings.
  arXiv  Detail & Related papers  (2024-06-23T00:27:28Z)
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games [102.46640028830441]
  We introduce the Optimistic Matrix Multiplicative Weights Update (OMMWU) algorithm and establish its average-iterate convergence complexity as $mathcalO(d/epsilon)$ to $epsilon$-Nash equilibria. This quadratic speed-up sets a new benchmark for computing $epsilon$-Nash equilibria in quantum zero-sum games.
  arXiv  Detail & Related papers  (2023-11-17T20:38:38Z)
• Photonic implementation of the quantum Morra game [69.65384453064829]
  We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case. We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game. We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
  arXiv  Detail & Related papers  (2023-11-14T19:41:50Z)
• Quantumizing Classical Games: An Introduction to Quantum Game Theory [2.023315598404668]
  We give a concise and self-contained introduction to the theory of Quantum Games by reviewing the seminal works of Meyer, Eisert-Wilkens-Lewenstein, Marinatto-Weber and Landsburg. We formulate a protocol to $textitQuantumize$ any finite classical $n$-player game, and use a novel approach of describing such a Quantum Game in terms of commuting Payoff Operators.
  arXiv  Detail & Related papers  (2023-04-30T02:14:09Z)
• Differentiable Arbitrating in Zero-sum Markov Games [59.62061049680365]
  We study how to perturb the reward in a zero-sum Markov game with two players to induce a desirable Nash equilibrium, namely arbitrating. The lower level requires solving the Nash equilibrium under a given reward function, which makes the overall problem challenging to optimize in an end-to-end way. We propose a backpropagation scheme that differentiates through the Nash equilibrium, which provides the gradient feedback for the upper level.
  arXiv  Detail & Related papers  (2023-02-20T16:05:04Z)
• Experimental Demonstration of Quantum Pseudotelepathy [8.366359388178546]
  We report a faithful experimental demonstration of quantum pseudotelepathy via playing the non-local version of Mermin-Peres magic square game. We adopt the hyperentanglement scheme and prepare photon pairs entangled in both the polarization and the orbital angular momentum degrees of freedom. Our results show that quantum players can simultaneously win all the queries over any classical strategy.
  arXiv  Detail & Related papers  (2022-06-24T02:35:55Z)
• Genuine multipartite entanglement and quantum coherence in an electron-positron system: Relativistic covariance [117.44028458220427]
  We analyze the behavior of both genuine multipartite entanglement and quantum coherence under Lorentz boosts. A given combination of these quantum resources is shown to form a Lorentz invariant.
  arXiv  Detail & Related papers  (2021-11-26T17:22:59Z)
• Sample-Efficient Learning of Stackelberg Equilibria in General-Sum Games [78.65798135008419]
  It remains vastly open how to learn the Stackelberg equilibrium in general-sum games efficiently from samples. This paper initiates the theoretical study of sample-efficient learning of the Stackelberg equilibrium in two-player turn-based general-sum games.
  arXiv  Detail & Related papers  (2021-02-23T05:11:07Z)
• Solving diner's dilemma game, circuit implementation, and verification on IBMQ simulator [0.0]
  We find the quantum strategy that gives maximum payoff for each diner without affecting the payoff and strategy of others. We present the circuit implementation for the game, design it on the IBM quantum simulator and verify the strategies in the quantum model.
  arXiv  Detail & Related papers  (2020-10-24T08:49:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.