Computing equilibria: a computational complexity perspective

Tim Roughgarden ()

Economic Theory, 2010, vol. 42, issue 1, pages 193-236

Keywords: Equilibrium computation; Computational complexity; NP-completeness; PPAD-completeness; C61; C63; C68 (search for similar items in EconPapers)
Date: 2010

Downloads: (external link)
http://hdl.handle.net/10.1007/s00199-009-0448-y (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:spr:joecth:v:42:y:2010:i:1:p:193-236

Ordering information: This journal article can be ordered from
http://link.springer.de/orders.htm

Access Statistics for this article

Economic Theory is edited by Nichoals Yanneils

More articles in Economic Theory from Springer
Series data maintained by Christopher F Baum ().