{"id":"https://openalex.org/W2972563375","doi":"https://doi.org/10.1007/978-3-030-30473-7_11","title":"On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria","display_name":"On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2972563375","doi":"https://doi.org/10.1007/978-3-030-30473-7_11","mag":"2972563375"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-30473-7_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30473-7_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/portal/en/publications/77043cac-af5b-4114-abff-b82b7ad19aaa","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010160671","display_name":"Marie Louisa T\u00f8lb\u00f8ll Berthelsen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Marie Louisa T\u00f8lb\u00f8ll Berthelsen","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055834958","display_name":"Kristoffer Arnsfelt Hansen","orcid":"https://orcid.org/0000-0002-1155-8072"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kristoffer Arnsfelt Hansen","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-1155-8072","affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":2.6624,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.90903087,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9995999932289124,"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.9995999932289124,"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/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9851999878883362,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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.9828000068664551,"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/computer-science","display_name":"Computer science","score":0.8401971459388733},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.662455141544342},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5350018739700317},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41322532296180725},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.35671424865722656},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3485347032546997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.294489324092865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1286691129207611}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8401971459388733},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.662455141544342},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5350018739700317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41322532296180725},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.35671424865722656},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3485347032546997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.294489324092865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1286691129207611}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-30473-7_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-30473-7_11","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/77043cac-af5b-4114-abff-b82b7ad19aaa","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/77043cac-af5b-4114-abff-b82b7ad19aaa","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berthelsen, M L T & Hansen, K A 2019, On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. in D Fotakis & E Markakis (eds), Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Proceedings. Springer VS, Cham, Lecture Notes in Computer Science, vol. 11801, pp. 153-167, 12th International Symposium: International Symposium on Algorithmic Game Theory, Athen, Greece, 30/09/2019. https://doi.org/10.1007/978-3-030-30473-7_11","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/77043cac-af5b-4114-abff-b82b7ad19aaa","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/77043cac-af5b-4114-abff-b82b7ad19aaa","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berthelsen, M L T & Hansen, K A 2019, On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. in D Fotakis & E Markakis (eds), Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Proceedings. Springer VS, Cham, Lecture Notes in Computer Science, vol. 11801, pp. 153-167, 12th International Symposium: International Symposium on Algorithmic Game Theory, Athen, Greece, 30/09/2019. https://doi.org/10.1007/978-3-030-30473-7_11","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W72488771","https://openalex.org/W1574151794","https://openalex.org/W1769087895","https://openalex.org/W1969557621","https://openalex.org/W1991624978","https://openalex.org/W2002373723","https://openalex.org/W2013815105","https://openalex.org/W2014267214","https://openalex.org/W2026177035","https://openalex.org/W2067754486","https://openalex.org/W2071846104","https://openalex.org/W2101230787","https://openalex.org/W2104892205","https://openalex.org/W2131662609","https://openalex.org/W2153135867","https://openalex.org/W2292587149","https://openalex.org/W2296078827","https://openalex.org/W2301555989","https://openalex.org/W2330024298","https://openalex.org/W2604467574","https://openalex.org/W2790462119","https://openalex.org/W2891099160","https://openalex.org/W4234761190","https://openalex.org/W4255213956"],"related_works":["https://openalex.org/W2803931294","https://openalex.org/W2282604764","https://openalex.org/W2569414037","https://openalex.org/W2500870930","https://openalex.org/W2218535193","https://openalex.org/W4389370903","https://openalex.org/W2468739564","https://openalex.org/W1554758635","https://openalex.org/W4302558842","https://openalex.org/W2171981925"],"abstract_inverted_index":{"We":[0,49,68,78,124],"study":[1],"the":[2,26,30,34,84,122,151,199],"computational":[3,152],"complexity":[4,41,153],"of":[5,33,40,86,118,144,154,227],"decision":[6,27,76,179],"problems":[7,16,85,180],"about":[8,73,181],"Nash":[9,95,105,135,163,183,215],"equilibria":[10,184],"in":[11,38,121,185,191],"m-player":[12,210],"games.":[13,67,172],"Several":[14],"such":[15],"have":[17],"recently":[18],"been":[19],"shown":[20],"to":[21,25,177,198],"be":[22],"computationally":[23],"equivalent":[24],"problem":[28],"for":[29,64,169],"existential":[31],"theory":[32],"reals,":[35],"or":[36,97],"stated":[37],"terms":[39],"classes,":[42],"$$\\exists":[43,60,108,138,218],"\\mathbb":[44,61,109,139,219],"{R}$$-complete,":[45],"when":[46,81,221],"$$m\\ge":[47,82,222],"3$$.":[48],"show":[50,79,125,204],"that,":[51],"unless":[52],"they":[53,58],"turn":[54],"into":[55],"trivial":[56],"problems,":[57],"are":[59,107],"{R}$$-hard":[62],"even":[63],"3-player":[65,170],"zero-sum":[66,171],"also":[69,150,167],"obtain":[70],"new":[71,194],"results":[72,166,195],"several":[74],"other":[75],"problems.":[77],"that":[80,126,205],"3$$":[83],"deciding":[87,98,127,155,206],"if":[88,99,128,156],"a":[89,92,100,103,115,129,142,157,160,208,213,225],"game":[90,101,130,158],"has":[91,102,131,159,212],"Pareto":[93],"optimal":[94],"equilibrium":[96,106,136,216],"strong":[104],"{R}$$-complete.":[110],"The":[111],"latter":[112],"result":[113],"rectifies":[114],"previous":[116],"claim":[117],"$$\\mathrm":[119],"{NP}$$-completeness":[120],"literature.":[123],"an":[132],"irrational":[133],"valued":[134,162],"is":[137,217],"{R}$$-hard,":[140],"answering":[141,224],"question":[143,226],"Bil\u00f3":[145],"and":[146,148,190,231],"Mavronicolas,":[147],"address":[149],"rational":[161],"equilibrium.":[164],"These":[165],"hold":[168],"Our":[173],"proof":[174],"methodology":[175],"applies":[176],"corresponding":[178],"symmetric":[182,186,200,209],"games":[187,211],"as":[188],"well,":[189],"particular":[192],"our":[193],"carry":[196],"over":[197],"setting.":[201],"Finally":[202],"we":[203],"whether":[207],"non-symmetric":[214],"{R}$$-complete":[220],"3$$,":[223],"Garg,":[228],"Mehta,":[229],"Vazirani,":[230],"Yazdanbod.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}