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

Abstract

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 ∃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 Štefankovič giving ∃R-completeness for the problem of deciding existence of a probability constrained Nash equilibrium.