Chen, Xi; Deng, Xiaotie; Teng, Shang-Hua Settling the complexity of computing two-player Nash equilibria. (English) Zbl 1325.68095 J. ACM 56, No. 3, Article No. 14, 57 p. (2009). Cited in 4 ReviewsCited in 131 Documents MSC: 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 91A05 2-person games 91A10 Noncooperative games 91B52 Special types of economic equilibria Keywords:Arrow-Debreu market; Brouwer’s fixed point; Lemke-Howson algorithm; Nash equilibrium; PPAD-completeness; Sperner’s lemma; two-player game; smoothed analysis Citations:Zbl 0798.68058; Zbl 1301.68142 PDFBibTeX XMLCite \textit{X. Chen} et al., J. ACM 56, No. 3, Article No. 14, 57 p. (2009; Zbl 1325.68095) Full Text: DOI arXiv