loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
Settling the Complexity of Two-Player Nash Equilibrium
Berkeley, California
October 21-October 24
ISBN: 0-7695-2720-5
ASCII Text
x 
 
Xi Chen, Xiaotie Deng, "Settling the Complexity of Two-Player Nash Equilibrium," Foundations of Computer Science, IEEE Annual 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, IEEE Annual 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, IEEE Annual 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, IEEE Annual Symposium on
ER -
 
Xi Chen, Tsinghua University, China
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
Usage of this product signifies your acceptance of the Terms of Use.