Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR12-025 | 23rd March 2012 01:00

Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques


Authors: Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
Publication: 26th March 2012 22:16
Downloads: 3855


We consider the problem of approximating the minmax value of a multiplayer game in strategic form. We argue that in 3-player games with 0-1 payoffs, approximating the minmax value within an additive constant smaller than $\xi/2$, where $\xi = \frac{3-\sqrt5}{2} \approx 0.382$, is not possible by a polynomial time algorithm. This is based on assuming hardness of a version of the so-called planted clique problem in Erd?s–Rényi random graphs, namely that of detecting a planted clique. Our results are stated as reductions from a promise graph problem to the problem of approximating the minmax value, and we use the detection problem for planted cliques to argue for its hardness.

We present two reductions: a randomized many-one reduction and a deterministic Turing reduction. The latter, which may be seen as a derandomization of the former, may be used to argue for hardness of approximating the minmax value based on a hardness assumption about deterministic algorithms. Our technique for derandomization is general enough to also apply to related work about $\epsilon$-Nash equilibria.

ISSN 1433-8092 | Imprint