How Hard Is It to Approximate the Best Nash Equilibrium?
DOI10.1137/090766991zbMath1229.91092OpenAlexW2069488552WikidataQ57567488 ScholiaQ57567488MaRDI QIDQ2999855
Elad Hazan, Robert Krauthgamer
Publication date: 17 May 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://epubs.siam.org/sicomp/resource/1/smjcat/v40/i1/p79_s1
Nash equilibriumcliquerandom graphtwo-player gameapproximate equilibriumpolynomial-time approximation schemealgorithmic game theory
2-person games (91A05) Combinatorics in computer science (68R05) Applications of game theory (91A80) Computational methods for problems pertaining to game theory, economics, and finance (91-08)
Related Items (20)
This page was built for publication: How Hard Is It to Approximate the Best Nash Equilibrium?