Quantum Information Processing

Characterization of Nash equilibria for quantum games in general position, with full SU(2) strategy space and varying entanglement

Yoshitaka Sakagami

Published Dec 7, 2024• 2 citations

DOI: 10.1007/s11128-024-04600-w

Related papers

Quantum Nash Equilibria for Games with Unitary Strategies: Existence in Mixed Strategies, an Entanglement Threshold, and a Stylized Interbank Liquidity Game

Nguyễn Kim Khánh

Sep 29, 20260 citations

Characterizing the Nash equilibria of a three-player Bayesian quantum game

Neal Solmeyer, Ricky Dixon, Radhakrishnan Balu

arXiv:1703.03291Quantum Information ProcessingApr 21, 201713 citations

Entanglement-decoherence-Nash equilibria diagrams in quantum games

Hoor Banu, K. Raghavendra Rao

Physics Letters AOct 18, 20232 citations

A Quantum Annealing Algorithm for Finding Pure Nash Equilibria in Graphical Games

Christoph Roch, Thomy Phan, Sebastian Feld +4 more

arXiv:1903.06454Lecture notes in computer scienceJan 1, 20206 citations

Game-theoretic discovery of quantum error-correcting codes through Nash equilibria

Anonymous

Physical Review AJul 13, 20260 citations

Classification of Nash Equilibria inQuantum Games

Yoshitaka Sakagami

Abstract We consider general quantum two-player games and investigate the effect of the degree of entanglement on Nash equilibria. The strategy set is SU(2). Each player's payoffs of the payoff table are different from each other. The purpose of this paper is to classify Nash equilibria by their payoff patterns. We derive all different payoff patterns of Nash equlibria which may occur. Further, for each payoff pattern, we derive all Nash equilibria for which this pattern occurs.

Aug 28, 20230 citations