Skip to main content
SpringerLink
Log in

The Computation of Equilibria

  • Conference paper
Internet and Network Economics (WINE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4858))

Included in the following conference series:

  • 2635 Accesses

Abstract

Ever since Nash’s existence theorem in 1951, the Nash equilibrium has been the standard solution concept in Game Theory, yet the issue of its computational complexity was resolved only recently by the proof that the problem is PPAD- complete [4], even in the two-player case [2]. In view of this result, research turned to several alternatives — an effect reminiscent of the reaction to NP-completeness in the 1970s: Approximation algorithms, special cases, and alternative equilibrium concepts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Borgs, C., Chayes, J., Immorlica, N., Kalai, A., Mirrokni, V., Papadimitriou, C.H.: The Myth of the Folk Theorem. ECCC TR07-82

    Google Scholar 

  2. Chen, X., Deng, X.: Settling the Complexity of 2-Player Nash-Equilibrium. In: Proceedings of FOCS (2006)

    Google Scholar 

  3. Chen, X., Deng, X., Teng, S.: Computing Nash Equilibria: Approximation and Smoothed Complexity. In: Proceedings of FOCS (2006)

    Google Scholar 

  4. Daskalakis, C., Goldberg, P.W., Papadimitriou, C.H.: The Complexity of Computing a Nash Equilibrium. In: Proceedings of STOC (2006)

    Google Scholar 

  5. Daskalakis, C., Mehta, A., Papadimitriou, C.H.: Progress in Approximate Nash equilibrium. In: 8th ACM Conference on Electronic Commerce (EC), ACM Press, New York (2007)

    Google Scholar 

  6. Daskalakis, C., Papadimitriou, C.H.: Computing Equilibria in Anonymous Games. In: proc. 2007 FOCS

    Google Scholar 

  7. Daskalakis, C., Papadimitriou, C.H.: In preparation

    Google Scholar 

  8. Fabrikant, A., Papadimitriou, C.H.: The Search for Equilibria: Sink Equilibria, Unit Recall Games, and BGP Oscillations in, SODA 2008 (to appear)

    Google Scholar 

  9. Littman, M., Stone, P.: A polynomial-time algorithm for repeated games. Decision Support Systems 31, 55–66 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UC Berkeley, California,  

    Christos H. Papadimitriou

Authors
  1. Christos H. Papadimitriou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Xiaotie Deng Fan Chung Graham

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papadimitriou, C.H. (2007). The Computation of Equilibria. In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77105-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77104-3

  • Online ISBN: 978-3-540-77105-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation