{"id":"https://openalex.org/W2051206974","doi":"https://doi.org/10.1145/1374376.1374428","title":"Inapproximability of pure nash equilibria","display_name":"Inapproximability of pure nash equilibria","publication_year":2008,"publication_date":"2008-05-17","ids":{"openalex":"https://openalex.org/W2051206974","doi":"https://doi.org/10.1145/1374376.1374428","mag":"2051206974"},"language":"en","primary_location":{"id":"doi:10.1145/1374376.1374428","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5011027667","display_name":"Alexander Skopalik","orcid":"https://orcid.org/0000-0002-4950-8708"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexander Skopalik","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany","RWTH-Aachen University, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"RWTH-Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066021048","display_name":"Berthold V\u00f6cking","orcid":null},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Berthold V\u00f6cking","raw_affiliation_strings":["RWTH Aachen University, Aachen, Germany","RWTH-Aachen University, Aachen, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"RWTH-Aachen University, Aachen, Germany","institution_ids":["https://openalex.org/I887968799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":20.0862,"has_fulltext":false,"cited_by_count":111,"citation_normalized_percentile":{"value":0.99520599,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"355","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9998999834060669,"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.9998999834060669,"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/T11182","display_name":"Auction Theory and Applications","score":0.9983000159263611,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9965999722480774,"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.7798548936843872},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5538585782051086},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4999260902404785},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49555790424346924},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.49434375762939453},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4937661588191986},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4914647340774536},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4844836890697479},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47745421528816223},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4593932628631592},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4388894736766815},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.43158161640167236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3371916115283966},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30212217569351196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20023617148399353}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.7798548936843872},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5538585782051086},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4999260902404785},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49555790424346924},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.49434375762939453},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4937661588191986},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4914647340774536},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4844836890697479},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47745421528816223},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4593932628631592},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4388894736766815},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.43158161640167236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3371916115283966},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30212217569351196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20023617148399353},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1374376.1374428","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374428","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.4012","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.4012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.algo.rwth-aachen.de/~voecking/publications/STOC08.pdf","raw_type":"text"},{"id":"pmh:oai:publications.rwth-aachen.de:100478","is_oa":false,"landing_page_url":"https://publications.rwth-aachen.de/record/100478","pdf_url":null,"source":{"id":"https://openalex.org/S4306401362","display_name":"RWTH Publications (RWTH Aachen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887968799","host_organization_name":"RWTH Aachen University","host_organization_lineage":["https://openalex.org/I887968799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 2008 ACM International Symposium on Theory of Computing : Victoria, British Columbia, Canada, May 17 - 20, 2008 / sponsored by: ACM SIGACT<br/>2008 ACM International Symposium on Theory of Computing, Victoria, Canada, 2008-05-17 - 2008-05-20","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1500428599","https://openalex.org/W1964011541","https://openalex.org/W1978317291","https://openalex.org/W1990873282","https://openalex.org/W1997075516","https://openalex.org/W2015061583","https://openalex.org/W2031636249","https://openalex.org/W2054129049","https://openalex.org/W2062459871","https://openalex.org/W2103981148","https://openalex.org/W2112269231","https://openalex.org/W2113154285","https://openalex.org/W2119813346","https://openalex.org/W2128013846","https://openalex.org/W2145297839","https://openalex.org/W3022321359","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W2236801283","https://openalex.org/W1853631319","https://openalex.org/W2728657731","https://openalex.org/W2092374696","https://openalex.org/W3207342620","https://openalex.org/W2803931294","https://openalex.org/W3030822758","https://openalex.org/W2760737027","https://openalex.org/W2621302897","https://openalex.org/W3097817394"],"abstract_inverted_index":{"The":[0],"complexity":[1,23],"of":[2,24,41,47,68,81,110,115,145],"computing":[3,25,132],"pure":[4],"Nash":[5],"equilibria":[6,27],"in":[7,28,44,153,166],"congestion":[8,29,84],"games":[9],"was":[10],"recently":[11],"shown":[12],"to":[13,156],"be":[14],"PLS-complete.":[15],"In":[16],"this":[17,124],"paper,":[18],"we":[19],"therefore":[20],"study":[21],"the":[22,42,48,62,108],"approximate":[26],"games.":[30],"An":[31],"alpha-approximate":[32],"equilibrium,":[33],"for":[34,89],"\u03b1":[35,93],">":[36,94],"1,":[37],"is":[38,86,98,126,148],"a":[39,66,82,101,112,116,138,143,157,169],"state":[40,141],"game":[43,85],"which":[45],"none":[46],"players":[49],"can":[50],"make":[51],"an":[52,56,78,120,133],"\u03b1-greedy":[53,146],"step,":[54],"i.e.,":[55,107],"unilateral":[57],"strategy":[58],"change":[59],"that":[60,76,131,161],"decreases":[61],"player's":[63],"cost":[64],"by":[65,119,142],"factor":[67],"at":[69],"least":[70],"\u03b1.":[71],"Our":[72,96,150],"main":[73],"result":[74,159],"shows":[75],"finding":[77,111],"\u03b1-approximate":[79,134],"equilibrium":[80,135],"given":[83,139],"sc":[87],"PLS-complete,":[88],"any":[90],"polynomial-time":[91],"computable":[92],"1.":[95],"analysis":[97],"based":[99],"on":[100],"gap":[102],"introducing":[103],"PLS-reduction":[104],"from":[105,137],"FLIP,":[106],"problem":[109,165],"local":[113,163],"optimum":[114],"function":[117],"encoded":[118],"arbitrary":[121],"circuit.":[122],"As":[123],"reduction":[125],"tight":[127],"it":[128],"additionally":[129],"implies":[130],"reachable":[136],"initial":[140],"sequence":[144],"steps":[147],"PSPACE-complete.":[149],"results":[151],"are":[152],"sharp":[154],"contrast":[155],"recent":[158],"showing":[160],"every":[162],"search":[164],"PLS":[167],"admits":[168],"fully":[170],"polynomial":[171],"time":[172],"approximation":[173],"scheme.":[174]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":13}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}