Small Clique Detection and Approximate Nash Equilibria

@inproceedings{Minder2009SmallCD,
  title={Small Clique Detection and Approximate Nash Equilibria},
  author={Lorenz Minder and Dan Vilenchik},
  booktitle={APPROX-RANDOM},
  year={2009}
}
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 Gn,1/2 of size C log n, 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… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
16 Citations
14 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

Similar Papers

Loading similar papers…