{"id":"https://openalex.org/W317705232","doi":"https://doi.org/10.1145/2189778.2189779","title":"The Computational Complexity of Nash Equilibria in Concisely Represented Games","display_name":"The Computational Complexity of Nash Equilibria in Concisely Represented Games","alternate_titles":[],"publication_year":2006,"publication_date":"2006-06-11","ids":{"openalex":"https://openalex.org/W317705232","doi":"https://doi.org/10.1145/2189778.2189779","mag":"317705232"},"language":"en","primary_location":{"id":"doi:10.1145/2189778.2189779","doi":"https://doi.org/10.1145/2189778.2189779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2189778.2189779","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W317705232"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dash.harvard.edu/bitstream/1/12763606/1/ThesisPaperBrattleStreet3-2-2012.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073672615","display_name":"Grant Robert Schoenebeck","orcid":"https://orcid.org/0000-0001-6878-0670","observed_orcids":["https://orcid.org/0000-0001-6878-0670"]},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Grant Schoenebeck","raw_affiliation_strings":["University of California, Berkeley, Berkeley, California","Princeton University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, Berkeley, California","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"Princeton University#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016656677","display_name":"Salil Vadhan","orcid":"https://orcid.org/0000-0002-4059-4072","observed_orcids":["https://orcid.org/0000-0002-4059-4072"]},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Salil Vadhan","raw_affiliation_strings":["Harvard University, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0218,"has_fulltext":true,"cited_by_count":62,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.85316189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":100},"biblio":{"volume":"4","issue":"2","first_page":"1","last_page":"279"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9878000020980835,"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.9878000020980835,"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.006399999838322401,"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.003700000001117587,"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.9520000219345093},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.8159999847412109},{"id":"https://openalex.org/keywords/circuit-games","display_name":"circuit games","score":0.9570000171661377},{"id":"https://openalex.org/keywords/graph-games","display_name":"graph games","score":0.9860000014305115},{"id":"https://openalex.org/keywords/pure-strategy-equilibrium","display_name":"pure Nash equilibrium","score":0.7039999961853027},{"id":"https://openalex.org/keywords/boolean-circuits","display_name":"Boolean circuits","score":0.41200000047683716}],"concepts":[{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.8212058544158936},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.6902164220809937},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.6328456401824951},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.6244639754295349},{"id":"https://openalex.org/C22349654","wikidata":"https://www.wikidata.org/wiki/Q2039354","display_name":"Risk dominance","level":5,"score":0.5571698546409607},{"id":"https://openalex.org/C21603316","wikidata":"https://www.wikidata.org/wiki/Q650738","display_name":"Folk theorem","level":5,"score":0.551070511341095},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.5442039370536804},{"id":"https://openalex.org/C163630976","wikidata":"https://www.wikidata.org/wiki/Q964667","display_name":"Correlated equilibrium","level":5,"score":0.5376476049423218},{"id":"https://openalex.org/C16946829","wikidata":"https://www.wikidata.org/wiki/Q1039525","display_name":"Trembling hand perfect equilibrium","level":5,"score":0.4914196729660034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46536707878112793},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4602815508842468},{"id":"https://openalex.org/C93733245","wikidata":"https://www.wikidata.org/wiki/Q3770642","display_name":"Symmetric game","level":5,"score":0.4420264959335327},{"id":"https://openalex.org/C155930848","wikidata":"https://www.wikidata.org/wiki/Q1069099","display_name":"Normal-form game","level":4,"score":0.42711341381073},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.419309139251709},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.39584052562713623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3879658877849579},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3554800748825073},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.353315532207489},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1908811330795288}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2189778.2189779","doi":"https://doi.org/10.1145/2189778.2189779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2189778.2189779","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","dongbi-c","jufo-1","norway-1","poland-70","russia-white-list-3"],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"doi:10.1145/1134707.1134737","doi":"https://doi.org/10.1145/1134707.1134737","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1134707.1134737","pdf_url":null,"source":{"id":"https://openalex.org/S7407087292","display_name":"ACM Conference on Electronic Commerce (EC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM conference on Electronic commerce","raw_type":"proceedings-article"},{"id":"pmh:oai:dash.harvard.edu:1/12763606","doi":null,"is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:12763606","pdf_url":"https://dash.harvard.edu/bitstream/1/12763606/1/ThesisPaperBrattleStreet3-2-2012.pdf","source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:dash.harvard.edu:1/12763606","doi":null,"is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:12763606","pdf_url":"https://dash.harvard.edu/bitstream/1/12763606/1/ThesisPaperBrattleStreet3-2-2012.pdf","source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G286214036","display_name":"CAREER: A Unified Theory of Pseudorandomness","funder_award_id":"0133096","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G395666998","display_name":"Applications of Artihmetic Combinatorics in Computer Science","funder_award_id":"0729137","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5250799987","display_name":null,"funder_award_id":"CCR-0133096CCF 0729137CCR-0133096","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G5580474416","display_name":null,"funder_award_id":"2006060","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320332388","display_name":"Radcliffe Institute for Advanced Study, Harvard University","ror":null},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W317705232.pdf","grobid_xml":"https://content.openalex.org/works/W317705232.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W42043901","https://openalex.org/W45689951","https://openalex.org/W106510103","https://openalex.org/W316638553","https://openalex.org/W1498333122","https://openalex.org/W1502958277","https://openalex.org/W1585643958","https://openalex.org/W1588415355","https://openalex.org/W1807884544","https://openalex.org/W1970606468","https://openalex.org/W1980813953","https://openalex.org/W2002373723","https://openalex.org/W2010476628","https://openalex.org/W2011112377","https://openalex.org/W2013815105","https://openalex.org/W2019578639","https://openalex.org/W2024091095","https://openalex.org/W2026177035","https://openalex.org/W2073048734","https://openalex.org/W2086653003","https://openalex.org/W2124272925","https://openalex.org/W2125537511","https://openalex.org/W2131967794","https://openalex.org/W2140790422","https://openalex.org/W2148352980","https://openalex.org/W2148957455","https://openalex.org/W2160135758","https://openalex.org/W2170677670","https://openalex.org/W2292587149","https://openalex.org/W2330024298","https://openalex.org/W2483516974","https://openalex.org/W2604653582","https://openalex.org/W4234761190"],"related_works":["https://openalex.org/W2124492011","https://openalex.org/W2019713702","https://openalex.org/W7095715755","https://openalex.org/W7095530059","https://openalex.org/W2094143906","https://openalex.org/W7097430896","https://openalex.org/W2101217556","https://openalex.org/W7099807082","https://openalex.org/W1502958277","https://openalex.org/W7095224479"],"abstract_inverted_index":{"Games":[0],"may":[1],"be":[2],"represented":[3,59],"in":[4,93,137],"many":[5,149],"different":[6,9],"ways,":[7],"and":[8,74,129],"representations":[10],"of":[11,16,30,50,57,85,105],"games":[12,62,76],"affect":[13],"the":[14,39,48,65,87,103,139,157],"complexity":[15,104,163],"problems":[17,158],"associated":[18],"with":[19],"games,":[20],"such":[21],"as":[22,47],"finding":[23,117],"a":[24,32,70,83,94,110,114,118,125,134,142],"Nash":[25,115,119,127,135],"equilibrium.":[26],"The":[27],"traditional":[28],"method":[29],"representing":[31],"game":[33],"is":[34,82,113],"to":[35,141],"explicitly":[36],"list":[37],"all":[38],"payoffs,":[40],"but":[41],"this":[42],"incurs":[43],"an":[44],"exponential":[45],"blowup":[46],"number":[49],"agents":[51],"grows.":[52],"We":[53],"study":[54,102],"two":[55,99],"models":[56],"concisely":[58],"games:":[60],"circuit":[61],",":[63,77],"where":[64,78],"payoffs":[66,140],"are":[67,159],"computed":[68],"by":[69,90],"given":[71,95,111,146],"boolean":[72],"circuit,":[73],"graph":[75],"each":[79],"agent\u2019s":[80],"payoff":[81],"function":[84],"only":[86],"strategies":[88],"played":[89],"its":[91],"neighbors":[92],"graph.":[96],"For":[97],"these":[98],"models,":[100],"we":[101,151],"four":[106],"questions:":[107],"determining":[108,121,130],"if":[109,122,131],"strategy":[112],"equilibrium,":[116,120,128],"there":[123,132],"exists":[124,133],"pure":[126],"equilibrium":[136],"which":[138],"player":[143],"meet":[144],"some":[145],"guarantees.":[147],"In":[148],"cases,":[150],"obtain":[152],"tight":[153],"results,":[154],"showing":[155],"that":[156],"complete":[160],"for":[161],"various":[162],"classes.":[164]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W317705232","counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":20},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
