Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games

We show that the problem of deciding whether in a multi-player perfect information recursive game (i.e. a stochastic game with terminal rewards) there exists a stationary Nash equilibrium ensuring each player a certain payoff is Existential Theory of the Reals complete. Our result holds for acyclic games, where a Nash equilibrium may be computed efficiently by backward induction, and even for deterministic acyclic games with non-negative terminal rewards. We further extend our results to the existence of Nash equilibria where a single player is surely winning. Combining our result with known gadget games without any stationary Nash equilibrium, we obtain that for cyclic games, just deciding existence of any stationary Nash equilibrium is Existential Theory of the Reals complete. This holds for reach-a-set games, stay-in-a-set games, and for deterministic recursive games.

[1]  Vittorio Bilò,et al.  A Catalog of ∃ R-Complete Decision Problems About Nash Equilibria in Multi-Player Games , 2016 .

[2]  Eitan Zemel,et al.  Nash and correlated equilibria: Some complexity considerations , 1989 .

[3]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[4]  Xiaotie Deng,et al.  Settling the Complexity of Two-Player Nash Equilibrium , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[5]  Ruta Mehta,et al.  ETR-Completeness for Decision Versions of Multi-player (Symmetric) Nash Equilibria , 2015, ICALP.

[6]  Felipe Cucker,et al.  Exotic Quantifiers, Complexity Classes, and Complete Problems , 2007, ICALP.

[7]  Hugo Gimbert,et al.  A Bridge between Polynomial Optimization and Games with Imperfect Recall , 2020, AAMAS.

[8]  Vladimir Gurvich,et al.  A three-person deterministic graphical game without Nash equilibria , 2016, Discret. Appl. Math..

[9]  J. Neumann,et al.  The Theory of Games and Economic Behaviour , 1944 .

[10]  Kristoffer Arnsfelt Hansen,et al.  A Stay-in-a-Set Game without a Stationary Equilibrium , 2019, GandALF.

[11]  Marcus Schaefer,et al.  Fixed Points, Nash Equilibria, and the Existential Theory of the Reals , 2017, Theory of Computing Systems.

[12]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Limit-Average Games , 2011, CONCUR.

[13]  Kristoffer Arnsfelt Hansen,et al.  On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria , 2019, Theory of Computing Systems.

[14]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.

[15]  Kousha Etessami,et al.  On the Complexity of Nash Equilibria and Other Fixed Points , 2010, SIAM J. Comput..

[16]  Dominik Wojtczak.  On Strong NP-Completeness of Rational Problems , 2018, CSR.

[17]  Michael L. Littman,et al.  An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees , 2006, UAI.

[18]  Piercesare Secchi,et al.  Stay-in-a-set games , 2002, Int. J. Game Theory.

[19]  Kristoffer Arnsfelt Hansen.  The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games , 2017, SAGT.

[20]  Patricia Bouyer,et al.  Mixed Nash Equilibria in Concurrent Terminal-Reward Games , 2014, FSTTCS.

[21]  Ruta Mehta,et al.  ∃R-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria , 2018, ACM Trans. Economics and Comput..

[22]  Vladimir Gurvich,et al.  On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles , 2003, Math. Soc. Sci..

[23]  Ashutosh Trivedi,et al.  On Pure Nash Equilibria in Stochastic Games , 2015, TAMC.

[24]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[25]  Dean Gillette,et al.  9. STOCHASTIC GAMES WITH ZERO STOP PROBABILITIES , 1958 .

[26]  János Flesch,et al.  Pure subgame-perfect equilibria in free transition games , 2009, Eur. J. Oper. Res..

[27]  Eric van Damme,et al.  Non-Cooperative Games , 2000 .

[28]  Krishnendu Chatterjee,et al.  On Nash Equilibria in Stochastic Games , 2004, CSL.

[29]  Vittorio Bilò,et al.  Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games , 2017, STACS.

[30]  Marcus Schaefer,et al.  Realizability of Graphs and Linkages , 2013 .

[31]  Dominik Wojtczak,et al.  The Complexity of Nash Equilibria in Stochastic Multiplayer Games , 2011, Log. Methods Comput. Sci..

[32]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[33]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[34]  Michael Ummels,et al.  Stochastic multiplayer games: theory and algorithms , 2010 .