The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions

DOI10.1109/FOCS.2011.26zbMath1292.91013OpenAlexW2055825234MaRDI QIDQ5495006

Rahul Savani, Paul W. Goldberg, Christos H. Papadimitriou

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.26

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Constant Rank Two-Player Games are PPAD-hard ⋮ On the multiplicity of solutions in generation capacity investment models with incomplete markets: a risk-averse stochastic equilibrium approach ⋮ Unnamed Item

This page was built for publication: The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions