Xi Chen, Xiaotie Deng,
"Settling the Complexity of Two-Player Nash Equilibrium,"
Foundations of Computer Science, Annual IEEE Symposium on, pp. 261-272, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006.
BibTex
x
@article{
10.1109/FOCS.2006.69, author = {Xi Chen and Xiaotie Deng}, title = {Settling the Complexity of Two-Player Nash Equilibrium}, journal ={Foundations of Computer Science, Annual IEEE Symposium on}, volume = {0}, year = {2006}, issn = {0272-5428}, pages = {261-272}, doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2006.69}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }
RefWorks Procite/RefMan/Endnote
x
TY - CONF JO - Foundations of Computer Science, Annual IEEE Symposium on TI - Settling the Complexity of Two-Player Nash Equilibrium SN - 0272-5428 SP261 EP272 A1 - Xi Chen, A1 - Xiaotie Deng, PY - 2006 KW - null VL - 0 JA - Foundations of Computer Science, Annual IEEE Symposium on ER -
Xiaotie Deng, City University of Hong Kong, Hong Kong, China
We prove that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete.
Citation:
Xi Chen, Xiaotie Deng, "Settling the Complexity of Two-Player Nash Equilibrium," focs, pp.261-272, 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), 2006
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb