Highly Influenced

@inproceedings{Hazan2009HowHI, title={How hard is it to approximate the best Nash equilibrium?}, author={Elad Hazan and Robert Krauthgamer}, booktitle={SODA}, year={2009} }

- Published 2009 in SODA
DOI:10.1137/090766991

The quest for a polynomial-time approximation scheme (PTAS) for Nash equilibrium in a two-player game, which emerged as a major open question in algorithmic game theory, seeks to circumvent the PPAD-completeness of finding an (exact) Nash equilibrium by finding an approximate equilibrium. The closely related problem of finding an equilibrium maximizing a certain objective, such as social welfare, was shown to be NP-hard [Gilboa and Zemel, Games Econom. Behav., 1 (1989), pp. 80–93]. However… CONTINUE READING

Highly Cited

This paper has 107 citations. REVIEW CITATIONS

Citations per Year

Semantic Scholar estimates that this publication has **107** citations based on the available data.

See our **FAQ** for additional information.

### Presentations referencing similar topics