Simple strategies for large zero-sum games with applications to complexity theory
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Expected complexity of graph partitioning problems
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
Journal of the ACM (JACM)
Finding a large hidden clique in a random graph
proceedings of the eighth international conference on Random structures and algorithms
Finding and certifying a large hidden clique in a semirandom graph
Random Structures & Algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
Progress in approximate nash equilibria
Proceedings of the 8th ACM conference on Electronic commerce
Approximability and Parameterized Complexity of Minmax Values
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Settling the complexity of computing two-player Nash equilibria
Journal of the ACM (JACM)
Small Clique Detection and Approximate Nash Equilibria
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The Complexity of Computing a Nash Equilibrium
SIAM Journal on Computing
Inapproximability of NP-complete variants of nash equilibrium
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing
| Hi-index | 0.00 |
We consider the problem of approximating the minmax value of a multi-player game in strategic form. We argue that in three-player games with 0-1 payoffs, approximating the minmax value within an additive constant smaller than ξ/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 randomised many-one reduction and a deterministic Turing reduction. The latter, which may be seen as a derandomisation 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 derandomisation is general enough to also apply to related work about ε-Nash equilibria.