Quantum game theory and the complexity of approximating quantum Nash equilibria release_7lsb4b776bgxzphap3ogvmptai

by John Bostanci, John Watrous

Released as a article .



This paper is concerned with complexity theoretic aspects of a general formulation of quantum game theory that models strategic interactions among rational agents that process and exchange quantum information. In particular, we prove that the computational problem of finding an approximate Nash equilibrium in a broad class of quantum games is, like the analogous problem for classical games, included in (and therefore complete for) the complexity class PPAD. Our main technical contribution, which facilitates this inclusion, is an extension of prior methods in computational game theory to strategy spaces that are characterized by semidefinite programs.
In text/plain format

Archived Files and Locations

application/pdf  331.8 kB
web.archive.org (webarchive)
arxiv.org (repository)
Read Archived PDF
Type  article
Stage   submitted
Date   2021-01-31
Version   v1
Language   en ?
arXiv  2102.00512v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: be32ac2a-c122-4208-9da2-a56035e4c9ed