The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

DOI

We show that for several solution concepts for finite n-player games, where n >= 3, the task of simply verifying its conditions is computationally equivalent to the decision problem of the existential theory of the reals. This holds for trembling hand perfect equilibrium, proper equilibrium, and CURB sets in strategic form games and for ( the strategy part of) sequential equilibrium, trembling hand perfect equilibrium, and quasi-perfect equilibrium in extensive form games of perfect recall. For obtaining these results we first show that the decision problem for the minmax value in n-player games, where n >= 3, is also equivalent to the decision problem for the existential theory of the reals. Our results thus improve previous results of NP-hardness as well as SQRT-SUM-hardness of the decision problems to completeness for there exists R, the complexity class corresponding to the decision problem of the existential theory of the reals. As a byproduct we also obtain a simpler proof of a result by Schaefer and Stefankovic giving there exists R-completeness for the problem of deciding existence of a probability constrained Nash equilibrium.

OriginalsprogEngelsk
TidsskriftTheory of Computing Systems
Vol/bind63
Nummer7
Sider (fra-til)1554-1571
ISSN1432-4350
DOI
StatusUdgivet - okt. 2019

Bibliografisk note

A preliminary version [23] of this paper appeared in the proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017).

This article is part of the Topical Collection on Special Issue on Algorithmic Game Theory (SAGT 2017)

Se relationer på Aarhus Universitet Citationsformater

ID: 136564315