The Computation of Equilibria

* Final gross prices may vary according to local VAT.

Get Access

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.