The Computation of Equilibria

  • Christos H. Papadimitriou
Conference paper

DOI: 10.1007/978-3-540-77105-0_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4858)
Cite this paper as:
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

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Christos H. Papadimitriou
    • 1
  1. 1.UC Berkeley, California 

Personalised recommendations