{"id":"https://openalex.org/W2002373723","doi":"https://doi.org/10.1137/070699652","title":"The Complexity of Computing a Nash Equilibrium","display_name":"The Complexity of Computing a Nash Equilibrium","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2002373723","doi":"https://doi.org/10.1137/070699652","mag":"2002373723"},"language":"en","primary_location":{"id":"doi:10.1137/070699652","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070699652","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034822411","display_name":"Constantinos Daskalakis","orcid":"https://orcid.org/0000-0002-5451-0490"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Constantinos Daskalakis","raw_affiliation_strings":["costis@cs.berkeley.edu and christos@cs.berkeley.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"costis@cs.berkeley.edu and christos@cs.berkeley.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067662147","display_name":"Paul W. Goldberg","orcid":"https://orcid.org/0000-0002-5436-7890"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul W. Goldberg","raw_affiliation_strings":["P.W.Goldberg@liverpool.ac.uk#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"P.W.Goldberg@liverpool.ac.uk#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103200572","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0000-7264-8015"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christos H. Papadimitriou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":45.3954,"has_fulltext":false,"cited_by_count":950,"citation_normalized_percentile":{"value":0.99902599,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"39","issue":"1","first_page":"195","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.8187637329101562},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.5953854918479919},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.5710785388946533},{"id":"https://openalex.org/keywords/epsilon-equilibrium","display_name":"Epsilon-equilibrium","score":0.5185545086860657},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.503628671169281},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4688616394996643},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.456750750541687},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4270581007003784},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4266108274459839},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3997926712036133},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3728697597980499},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1271439492702484}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.8187637329101562},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.5953854918479919},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5710785388946533},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.5185545086860657},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.503628671169281},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4688616394996643},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.456750750541687},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4270581007003784},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4266108274459839},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3997926712036133},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3728697597980499},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1271439492702484}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1137/070699652","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070699652","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.9397","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.9397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/homes/jf/ppad.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.151.4628","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.4628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.gsb.stanford.edu/facseminars/pdfs/2006_12-18_Papadimitriou.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.7003","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.7003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://http.cs.berkeley.edu/~christos/papers/nashDGPjournal_ver9.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.56","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.56","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.liv.ac.uk/~pwg/papers/CACM-dgp09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.845","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.845","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csc.liv.ac.uk/~pwg/papers/SICOMP-dgp09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.160.4387","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.4387","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://http.cs.berkeley.edu/~christos/papers/cacmDGP-2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.222.5397","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.5397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.distcomp.ethz.ch/lectures/fs10/seminar/paper/raphael-5.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.600.7596","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.600.7596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://home.deib.polimi.it/ngatti/Teaching/AGT/CGT/PapadimitriuComplexity.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.68.6111","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.6111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://http.cs.berkeley.edu/~christos/papers/ppad.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.87.3480","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.3480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/~costis/papers/ppad.pdf","raw_type":"text"},{"id":"pmh:oai:bibcyt.ucla.edu.ve:T070300015730/22","is_oa":false,"landing_page_url":"http://bibcyt.ucla.edu.ve/cgi-win/be_alex.exe?Acceso=T070300015730/22&Nombrebd=Bciucla","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W170909978","https://openalex.org/W850385441","https://openalex.org/W1966347268","https://openalex.org/W1980813953","https://openalex.org/W2008968905","https://openalex.org/W2017781790","https://openalex.org/W2037028865","https://openalex.org/W2058787498","https://openalex.org/W2060186712","https://openalex.org/W2060412450","https://openalex.org/W2067151918","https://openalex.org/W2070994188","https://openalex.org/W2075567596","https://openalex.org/W2080286264","https://openalex.org/W2089649903","https://openalex.org/W2094689434","https://openalex.org/W2103981148","https://openalex.org/W2131552123","https://openalex.org/W2153961011","https://openalex.org/W2169359757","https://openalex.org/W2292587149","https://openalex.org/W4234761190"],"related_works":["https://openalex.org/W2092374696","https://openalex.org/W2481143976","https://openalex.org/W4301347782","https://openalex.org/W3125812435","https://openalex.org/W1667857601","https://openalex.org/W2803932348","https://openalex.org/W1976009178","https://openalex.org/W3097817394","https://openalex.org/W2760737027","https://openalex.org/W2146267939"],"abstract_inverted_index":{"How":[0],"long":[1],"does":[2],"it":[3],"take":[4],"until":[5],"economic":[6],"agents":[7],"converge":[8],"to":[9,38,71],"an":[10,40],"equilibrium?":[11],"By":[12],"studying":[13],"the":[14,17,64,72,83,100,135],"complexity":[15],"of":[16,19,66,85,105,120,138],"problem":[18],"computing":[20],"a":[21,26,55,79,94,112,118,144],"mixed":[22,95],"Nash":[23,101,113],"equilibrium":[24,41,96,114],"in":[25,35,82,103,132],"game,":[27],"we":[28],"provide":[29],"evidence":[30],"that":[31,53,60,90,106,110,140],"there":[32],"are":[33,61],"games":[34,86],"which":[36],"convergence":[37],"such":[39],"takes":[42],"prohibitively":[43],"long.":[44],"Traditionally,":[45],"computational":[46],"problems":[47,74,121,131],"fall":[48],"into":[49],"two":[50],"classes:":[51],"those":[52,59],"have":[54],"polynomial-time":[56],"algorithm,":[57],"and":[58],"NP-hard.":[62],"However,":[63],"concept":[65],"NP-hardness":[67],"cannot":[68],"be":[69],"applied":[70],"rare":[73],"where":[75],"\u201cevery":[76],"instance":[77,142],"has":[78,93,143],"solution\u201d\u2014for":[80],"example,":[81],"case":[84],"Nash\u2019s":[87],"theorem":[88],"asserts":[89],"every":[91,141],"game":[92],"(now":[97],"known":[98,127],"as":[99],"equilibrium,":[102],"honor":[104],"result).":[107],"We":[108],"show":[109],"finding":[111],"is":[115],"complete":[116],"for":[117],"class":[119],"called":[122],"PPAD,":[123],"containing":[124],"several":[125],"other":[126],"hard":[128],"problems;":[129],"all":[130],"PPAD":[133],"share":[134],"same":[136],"style":[137],"proof":[139],"solution.":[145],"1.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":21},{"year":2025,"cited_by_count":38},{"year":2024,"cited_by_count":42},{"year":2023,"cited_by_count":64},{"year":2022,"cited_by_count":58},{"year":2021,"cited_by_count":107},{"year":2020,"cited_by_count":95},{"year":2019,"cited_by_count":74},{"year":2018,"cited_by_count":56},{"year":2017,"cited_by_count":60},{"year":2016,"cited_by_count":52},{"year":2015,"cited_by_count":57},{"year":2014,"cited_by_count":59},{"year":2013,"cited_by_count":40},{"year":2012,"cited_by_count":28}],"updated_date":"2026-06-16T09:24:06.705377","created_date":"2025-10-10T00:00:00"}