Equilibria, fixed points, and complexity classes

DOI10.4230/LIPICS.STACS.2008.1311MaRDI QIDQ4910705zbMATH OpenFDO

Authors Mihalis Yannakakis

Publication date 19 March 2013

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_f8a4.html

zbMATH Keywords

computational complexitygame theoryequilibriafixed points

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other game-theoretic models (91A40)

Recommendations

• Equilibria, fixed points, and complexity classes
• On the Complexity of Nash Equilibria and Other Fixed Points
• Equilibria, fixed points, and computational complexity -- Nevanlinna prize lecture
• The complexity of computing a Nash equilibrium
• The complexity of computing a Nash equilibrium

Cited in

(9)

• Computational aspects of equilibria
• Financial networks with singleton liability priorities
• Equilibria, fixed points, and complexity classes
• Equilibria, fixed points, and computational complexity -- Nevanlinna prize lecture
• The complexity of gradient descent (invited talk)
• Financial networks with singleton liability priorities
• Computing equilibria: a computational complexity perspective
• Fixed points, Nash equilibria, and the existential theory of the reals
• Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games

This page was built for publication: Equilibria, fixed points, and complexity classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910705)