Settling the complexity of two-player nash equilibrium

Xi Chen; Xiaotie Deng

doi:10.1109/FOCS.2006.69

Settling the complexity of two-player nash equilibrium

Xi Chen
, Xiaotie Deng

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

366 Citations (Scopus)

Abstract

Original language	English
Title of host publication	47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
Pages	261-270
DOIs	https://doi.org/10.1109/FOCS.2006.69
Publication status	Published - 2006
Event	47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006 - Berkeley, CA, United States Duration: 21 Oct 2006 → 24 Oct 2006

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)	0272-5428

Conference

Conference	47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006
Place	United States
City	Berkeley, CA
Period	21/10/06 → 24/10/06

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

Xiaotie Deng would like to acknowledge the support by a travel grant of Department of Computer Science, City University of Hong Kong.

Policy Impact

Cited in Policy Documents

Access Output

10.1109/FOCS.2006.69

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{c5c1c7fe09d94058a8d8e0ceb9ed139a,

title = "Settling the complexity of two-player nash equilibrium",

abstract = "We prove that the problem of finding a Nash equilibrium in a two-player game is PPAD-complete. {\textcopyright} 2006 IEEE.",

author = "Xi Chen and Xiaotie Deng",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006 ; Conference date: 21-10-2006 Through 24-10-2006",

year = "2006",

doi = "10.1109/FOCS.2006.69",

language = "English",

isbn = "0769527205",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

pages = "261--270",

booktitle = "47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006",

}

Chen, X & Deng, X 2006, Settling the complexity of two-player nash equilibrium. in 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006., 4031362, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, pp. 261-270, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006, Berkeley, CA, United States, 21/10/06. https://doi.org/10.1109/FOCS.2006.69

Settling the complexity of two-player nash equilibrium. / Chen, Xi; Deng, Xiaotie.
47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. 2006. p. 261-270 4031362 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Settling the complexity of two-player nash equilibrium

AU - Chen, Xi

AU - Deng, Xiaotie

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2006

Y1 - 2006

UR - https://www.scopus.com/pages/publications/36448948767

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-36448948767&origin=recordpage

UR - https://app-overton-io.ezproxy.cityu.edu.hk/articles.php?query=10.1109/FOCS.2006.69

U2 - 10.1109/FOCS.2006.69

DO - 10.1109/FOCS.2006.69

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 0769527205

SN - 9780769527208

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 261

EP - 270

BT - 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006

T2 - 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006

Y2 - 21 October 2006 through 24 October 2006

ER -

Settling the complexity of two-player nash equilibrium

Abstract

Publication series

Conference

Bibliographical note

Funding

Policy Impact

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this