Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style
icon Submit Paper


RSS-Feed
REPORTS > DETAIL:

Revision(s):

Revision #1 to TR05-140 | 20th February 2006 00:00

Settling the Complexity of 2-Player Nash-Equilibrium

Contact
Add Comment
RSS-Feed




Revision #1 Authors: Xi Chen, Xiaotie Deng
Accepted on: 20th February 2006 00:00
Downloads: 6513
Keywords: 


Abstract:

We prove that finding a solution of two player Nash Equilibrium is PPAD-complete.


Paper:

TR05-140 | 30th November 2005 00:00

Settling the Complexity of 2-Player Nash-Equilibrium





TR05-140 Authors: Xi Chen, Xiaotie Deng
Publication: 4th December 2005 19:45
Downloads: 4550
Keywords: 


Abstract:

We prove that finding the solution of two player Nash Equilibrium is PPAD-complete.


ISSN 1433-8092 | Imprint