{"id":"https://openalex.org/W2069488552","doi":"https://doi.org/10.1137/090766991","title":"How Hard Is It to Approximate the Best Nash Equilibrium?","display_name":"How Hard Is It to Approximate the Best Nash Equilibrium?","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2069488552","doi":"https://doi.org/10.1137/090766991","mag":"2069488552"},"language":"en","primary_location":{"id":"doi:10.1137/090766991","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090766991","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/A5024431603","display_name":"Elad Hazan","orcid":"https://orcid.org/0000-0002-1566-3216"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Elad Hazan","raw_affiliation_strings":["ehazan@ie.technion.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"ehazan@ie.technion.ac.il#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037378898","display_name":"Robert Krauthgamer","orcid":"https://orcid.org/0009-0003-8154-3735"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Krauthgamer","raw_affiliation_strings":["robert.krauthgamer@weizmann.ac.il#TAB#"],"affiliations":[{"raw_affiliation_string":"robert.krauthgamer@weizmann.ac.il#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024431603"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":14.8167,"has_fulltext":false,"cited_by_count":120,"citation_normalized_percentile":{"value":0.99134476,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"40","issue":"1","first_page":"79","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9994999766349792,"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/T11182","display_name":"Auction Theory and Applications","score":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T11031","display_name":"Game Theory and Applications","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.8374155759811401},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.6408013701438904},{"id":"https://openalex.org/keywords/epsilon-equilibrium","display_name":"Epsilon-equilibrium","score":0.6294903755187988},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.5683227181434631},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5600085258483887},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5270110368728638},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5052769780158997},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4481467604637146},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.44670283794403076},{"id":"https://openalex.org/keywords/risk-dominance","display_name":"Risk dominance","score":0.4266255497932434},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.4248873293399811},{"id":"https://openalex.org/keywords/equilibrium-selection","display_name":"Equilibrium selection","score":0.41210633516311646},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36435937881469727},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.25873643159866333},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.08932137489318848}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.8374155759811401},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.6408013701438904},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.6294903755187988},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5683227181434631},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5600085258483887},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5270110368728638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5052769780158997},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4481467604637146},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.44670283794403076},{"id":"https://openalex.org/C22349654","wikidata":"https://www.wikidata.org/wiki/Q2039354","display_name":"Risk dominance","level":5,"score":0.4266255497932434},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.4248873293399811},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.41210633516311646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36435937881469727},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.25873643159866333},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08932137489318848},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/090766991","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090766991","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1492831324","https://openalex.org/W1972894929","https://openalex.org/W2002373723","https://openalex.org/W2010601719","https://openalex.org/W2027470314","https://openalex.org/W2044667552","https://openalex.org/W2057913812","https://openalex.org/W2062307640","https://openalex.org/W2078758709","https://openalex.org/W2166602562","https://openalex.org/W2177603603","https://openalex.org/W2292587149","https://openalex.org/W3139080059","https://openalex.org/W4238472918"],"related_works":["https://openalex.org/W1554758635","https://openalex.org/W2274855902","https://openalex.org/W157961742","https://openalex.org/W1853631319","https://openalex.org/W3192122086","https://openalex.org/W2500870930","https://openalex.org/W3122939903","https://openalex.org/W4301347782","https://openalex.org/W4221157020","https://openalex.org/W4302558842"],"abstract_inverted_index":{"The":[0,42],"quest":[1],"for":[2,8,147,159,212],"a":[3,12,18,51,87,120,127,135,145,157,169,181,187,213],"polynomial-time":[4,136],"approximation":[5],"scheme":[6],"(PTAS)":[7],"Nash":[9,35,148,163],"equilibrium":[10,36,49,125,149],"in":[11,22,95,119,176,186],"two-player":[13,121],"game,":[14],"which":[15],"emerged":[16],"as":[17,55],"major":[19],"open":[20],"question":[21],"algorithmic":[23],"game":[24,122],"theory,":[25],"seeks":[26],"to":[27,60,78,80,133,156],"circumvent":[28],"the":[29,84,98,161,172,205],"PPAD-completeness":[30],"of":[31,46,97,140,179],"finding":[32,38,47,118,160,180],"an":[33,39,48,123,195],"(exact)":[34],"by":[37],"approximate":[40,81,124],"equilibrium.":[41,164],"closely":[43],"related":[44],"problem":[45,175],"maximizing":[50],"certain":[52],"objective,":[53],"such":[54],"social":[56,129],"welfare,":[57,130],"was":[58],"shown":[59],"be":[61],"NP-hard":[62],"[Gilboa":[63],"and":[64,93],"Zemel,":[65],"Games":[66],"Econom.":[67],"Behav.,":[68],"1":[69],"(1989),":[70],"pp.":[71,109],"80\u201393].":[72],"However,":[73],"this":[74,114],"NP-hardness":[75],"is":[76,131,143,168],"unlikely":[77,132],"extend":[79,155],"equilibria,":[82],"since":[83],"latter":[85],"admits":[86],"quasi-polynomial":[88],"time":[89],"algorithm":[90],"[Lipton,":[91],"Markakis,":[92],"Mehta,":[94],"Proceedings":[96],"4th":[99],"ACM":[100],"Conference":[101],"on":[102],"Electronic":[103],"Commerce,":[104],"ACM,":[105],"New":[106],"York,":[107],"2003,":[108],"36\u201341].":[110],"We":[111],"show":[112],"that":[113,144],"optimization":[115],"problem,":[116],"namely,":[117],"achieving":[126],"large":[128],"have":[134],"algorithm.":[137],"One":[138],"interpretation":[139],"our":[141,166],"results":[142],"PTAS":[146,158],"(if":[150],"it":[151],"exists)":[152],"should":[153],"not":[154],"best":[162],"Technically,":[165],"result":[167],"reduction":[170,192],"from":[171,194],"notoriously":[173],"difficult":[174],"modern":[177],"combinatorics,":[178],"planted":[182,198],"(but":[183],"hidden)":[184],"clique":[185,199,216],"random":[188],"graph":[189],"$G(n,1/2)$.":[190],"Our":[191],"starts":[193],"instance":[196],"with":[197],"size":[200,217],"$O(\\log":[201],"n)$.":[202],"For":[203],"comparison,":[204],"currently":[206],"known":[207],"algorithms":[208],"are":[209],"effective":[210],"only":[211],"much":[214],"larger":[215],"$\\Omega(\\sqrt{n})$.":[218]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}