Settling the Complexity of Computing Two-Player Nash Equilibria

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Xi Chen, Xiaotie Deng, Shang-Hua Teng
• Keywords: Complexity Class Ppad, CORR 2007, Education, Nash Equilibrium, Polynomial Parity Argument