DocumentCode
2913678
Title
Settling the Complexity of Two-Player Nash Equilibrium
Author
Chen, Xi ; Deng, Xiaotie
Author_Institution
Dept. of Comput. Sci., Tsinghua Univ., Beijing
fYear
2006
fDate
Oct. 2006
Firstpage
261
Lastpage
272
Abstract
Even though many people thought the problem of finding Nash equilibria is hard in general, and it has been proven so for games among three or more players recently, it´s not clear whether the two-player case can be shown in the same class of PPAD-complete problems. We prove that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete
Keywords
computational complexity; decision theory; game theory; PPAD-complete problems; two-player Nash equilibrium complexity; two-player games; Application software; Computer science; Ellipsoids; Game theory; Linear programming; Mathematical model; Nash equilibrium; Optimization methods; Polynomials; Sampling methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 2006. FOCS '06. 47th Annual IEEE Symposium on
Conference_Location
Berkeley, CA
ISSN
0272-5428
Print_ISBN
0-7695-2720-5
Type
conf
DOI
10.1109/FOCS.2006.69
Filename
4031362
Link To Document