Complexity of Bimatrix Nash Equilibria

Years and Authors of Summarized Original Work

• 2006; Chen, Deng

Problem Definition

In the middle of the last century, Nash [8] studied general noncooperative games and proved that there exists a set of mixed strategies, now commonly referred to as a Nash equilibrium, one for each player, such that no player can benefit if he/she changes his/her own strategy unilaterally. Since the development of Nash’s theorem, researchers have worked on how to compute Nash equilibria efficiently. Despite much effort in the last half century, no significant progress has been made on characterizing its algorithmic complexity, though both hardness results and algorithms have been developed for various modified versions.

An exciting breakthrough, which shows that computing Nash equilibria is possibly hard, was made by Daskalakis, Goldberg, and Papadimitriou [5], for games among four players or more. The problem was proven to be complete in PPAD(polynomial parity argument, directed version), a complexity...