The Computation of Equilibria

Download Book (10,744 KB) As a courtesy to our readers the eBook is provided DRM-free. However, please note that Springer uses effective methods and state-of-the art technology to detect, stop, and prosecute illegal sharing to safeguard our authors’ interests.
Download Chapter (161 KB)

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.