Repeated quantum game as a stochastic game: Effects of the shadow of the future and entanglement

• URL: http://arxiv.org/abs/2312.05124v1
• Date: Fri, 8 Dec 2023 15:54:51 GMT
• Title: Repeated quantum game as a stochastic game: Effects of the shadow of the future and entanglement
• Authors: Archan Mukhopadhyay, Saikat Sur, Tanay Saha, Shubhadeep Sadhukhan, Sagar Chakraborty
• Abstract summary: We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol. We find that how two pure strategies fare against each other is crucially dependent on the discount factor. In the quantum game setup, always-defect strategy can be beaten by the tit-for-tat strategy for high enough discount factor.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical randomness -- can be mapped to the paradigm of stochastic games. Subsequently, using the setup of two-player--two-action games, we explore the pure reactive strategies belonging to the set of reactive strategies, whose support in the quantum games is no longer countably finite but rather non-denumerably infinite. We find that how two pure strategies fare against each other is crucially dependent on the discount factor (the probability of occurrence of every subsequent round) and how much entangled the quantum states of the players are. We contrast the results obtained with the corresponding results in the classical setup and find fundamental differences between them: e.g, when the underlying game is the prisoner's dilemma, in the quantum game setup, always-defect strategy can be beaten by the tit-for-tat strategy for high enough discount factor.

Related papers

• A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
  A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover. We establish a quantum soundness result for all compiled two-player nonlocal games.
  arXiv  Detail & Related papers  (2024-08-13T08:11:56Z)
• 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)
• Variational Methods for Computing Non-Local Quantum Strategies [1.95414377613382]
  In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. We show that our algorithm is capable of generating a short-depth circuit that implements an optimal quantum strategy for a graph coloring game.
  arXiv  Detail & Related papers  (2023-11-02T16:17:18Z)
• Finding mixed-strategy equilibria of continuous-action games without gradients using randomized policy networks [83.28949556413717]
  We study the problem of computing an approximate Nash equilibrium of continuous-action game without access to gradients. We model players' strategies using artificial neural networks. This paper is the first to solve general continuous-action games with unrestricted mixed strategies and without any gradient information.
  arXiv  Detail & Related papers  (2022-11-29T05:16:41Z)
• No-Regret Learning in Time-Varying Zero-Sum Games [99.86860277006318]
  Learning from repeated play in a fixed zero-sum game is a classic problem in game theory and online learning. We develop a single parameter-free algorithm that simultaneously enjoys favorable guarantees under three performance measures. Our algorithm is based on a two-layer structure with a meta-algorithm learning over a group of black-box base-learners satisfying a certain property.
  arXiv  Detail & Related papers  (2022-01-30T06:10:04Z)
• Quantum guessing games with posterior information [68.8204255655161]
  A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial information after a quantum measurement has been performed. We formalize symmetry of guessing games and characterize the optimal measurements in cases where the symmetry is related to an irreducible representation.
  arXiv  Detail & Related papers  (2021-07-25T19:10:26Z)
• Quantum version of a generalized Monty Hall game and its possible applications to quantum secure communications [0.0]
  We propose a quantum version of a generalized Monty Hall game, in which the parameters of the game are left free, and not fixed on its regular values. We extend our quantum scheme to include multiple independent players, and use this extension to sketch two possible application of the game mechanics to quantum networks.
  arXiv  Detail & Related papers  (2020-10-26T17:57:12Z)
• 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)
• Learning to Play Sequential Games versus Unknown Opponents [93.8672371143881]
  We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. Our results include algorithm's regret guarantees that depend on the regularity of the opponent's response.
  arXiv  Detail & Related papers  (2020-07-10T09:33:05Z)
• Infinitely Repeated Quantum Games and Strategic Efficiency [0.0]
  Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied.
  arXiv  Detail & Related papers  (2020-05-12T07:39:42Z)

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.