Settling the Complexity of Computing Two-Player Nash Equilibria

13 years 9 months ago

Download www.cs.bu.edu

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

Xi Chen, Xiaotie Deng, Shang-Hua Teng

Real-time Traffic

Complexity Class Ppad | CORR 2007 | Education | Nash Equilibrium | Polynomial Parity Argument |

claim paper

» Hardness of Pure Nash Equilibrium in Scheduling and Connection Games

» Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration

» Settling the Complexity of ArrowDebreu Equilibria in Markets with Additively Separable Uti...

» Computing Proper Equilibria of ZeroSum Games

» How Incomputable is Finding Nash Equilibria

» Computing Approximate Nash Equilibria in Network Congestion Games

» The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

» Equilibria Fixed Points and Complexity Classes

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Xi Chen, Xiaotie Deng, Shang-Hua Teng

Comments (0)

Sciweavers

Settling the Complexity of Computing Two-Player Nash Equilibria

Complexity Class Ppad | CORR 2007 | Education | Nash Equilibrium | Polynomial Parity Argument |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers