Expected complexity of graph partitioning problems
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
A Spectral Technique for Coloring Random 3-Colorable Graphs
SIAM Journal on Computing
Finding a large hidden clique in a random graph
proceedings of the eighth international conference on Random structures and algorithms
Hiding Cliques for Cryptographic Security
Designs, Codes and Cryptography
Relations between average case complexity and approximation complexity
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Playing large games using simple strategies
Proceedings of the 4th ACM conference on Electronic commerce
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Computing Nash Equilibria: Approximation and Smoothed Complexity
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
How hard is it to approximate the best Nash equilibrium?
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Complexity results about Nash equilibria
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An optimization approach for approximate Nash equilibria
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Statistical algorithms and a lower bound for detecting planted cliques
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small *** , an *** -best *** -approximate Nash equilibrium can be found in polynomial time in two-player games, then it is also possible to find a planted clique in G n , 1/2 of size C logn , where C is a large fixed constant independent of *** . In this paper, we extend their result to show that if an *** -best *** -approximate equilibrium can be efficiently found for arbitrarily small *** 0, then one can detect the presence of a planted clique of size (2 + *** ) logn in G n , 1/2 in polynomial time for arbitrarily small *** 0. Our result is optimal in the sense that graphs in G n , 1/2 have cliques of size (2 *** o (1)) logn with high probability.