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

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 CUR...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theory of computing systems Ročník 63; číslo 7; s. 1554 - 1571
Hlavní autor: Hansen, Kristoffer Arnsfelt
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.10.2019
Springer Nature B.V
Témata:
Completeness
Complexity
Computer Science
Decision theory
Equilibrium
Equivalence
Game theory
Special Issue on Algorithmic Game Theory (SAGT 2017)
Theory of Computation
Minmax value
Existential theory of the reals
Nash equilibrium refinements
Computational complexity
ISSN:1432-4350, 1433-0490
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 ∃ ℝ , 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 Štefankovič giving ∃ ℝ -completeness for the problem of deciding existence of a probability constrained Nash equilibrium.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-018-9887-9