Sciweavers

APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
13 years 11 months ago
Small Clique Detection and Approximate Nash Equilibria
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 ...
Lorenz Minder, Dan Vilenchik