{"id":"https://openalex.org/W2891099160","doi":"https://doi.org/10.1007/s00224-018-9887-9","title":"The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games","display_name":"The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games","publication_year":2018,"publication_date":"2018-09-18","ids":{"openalex":"https://openalex.org/W2891099160","doi":"https://doi.org/10.1007/s00224-018-9887-9","mag":"2891099160"},"language":"en","primary_location":{"id":"doi:10.1007/s00224-018-9887-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-018-9887-9","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://pure.au.dk/ws/files/201919204/The_Real_Computational_Complexity_of_Minmax_Value_and_Equilibrium.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Kristoffer Arnsfelt Hansen","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Aarhus, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-1155-8072","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055834958"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":{"value":2890,"currency":"USD","value_usd":2890},"fwci":0.762,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.75479252,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"63","issue":"7","first_page":"1554","last_page":"1571"},"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9857000112533569,"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"}},{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9735999703407288,"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/minimax","display_name":"Minimax","score":0.7261033058166504},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.694248616695404},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5325853824615479},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4158034324645996},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35651054978370667},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34209102392196655},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.04578518867492676}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7261033058166504},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.694248616695404},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5325853824615479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4158034324645996},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35651054978370667},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34209102392196655},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.04578518867492676}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00224-018-9887-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00224-018-9887-9","pdf_url":null,"source":{"id":"https://openalex.org/S4210177266","display_name":"Theory of Computing Systems","issn_l":"0025-5661","issn":["0025-5661","1432-4350","1433-0490"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/6880e8d9-6c41-4718-a4f6-1ebadd673f6b","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/6880e8d9-6c41-4718-a4f6-1ebadd673f6b","pdf_url":"https://pure.au.dk/ws/files/201919204/The_Real_Computational_Complexity_of_Minmax_Value_and_Equilibrium.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen, K A 2019, 'The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games', Theory of Computing Systems, vol. 63, no. 7, pp. 1554-1571. https://doi.org/10.1007/s00224-018-9887-9","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/6880e8d9-6c41-4718-a4f6-1ebadd673f6b","is_oa":true,"landing_page_url":"https://pure.au.dk/portal/en/publications/6880e8d9-6c41-4718-a4f6-1ebadd673f6b","pdf_url":"https://pure.au.dk/ws/files/201919204/The_Real_Computational_Complexity_of_Minmax_Value_and_Equilibrium.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen, K A 2019, 'The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games', Theory of Computing Systems, vol. 63, no. 7, pp. 1554-1571. https://doi.org/10.1007/s00224-018-9887-9","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2891099160.pdf","grobid_xml":"https://content.openalex.org/works/W2891099160.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W41260695","https://openalex.org/W176071698","https://openalex.org/W1511735024","https://openalex.org/W1522839481","https://openalex.org/W1769087895","https://openalex.org/W1831487628","https://openalex.org/W1851007572","https://openalex.org/W1896273662","https://openalex.org/W1965194288","https://openalex.org/W1969557621","https://openalex.org/W1991624978","https://openalex.org/W1998191601","https://openalex.org/W2002373723","https://openalex.org/W2006794473","https://openalex.org/W2008288183","https://openalex.org/W2013815105","https://openalex.org/W2023517618","https://openalex.org/W2026177035","https://openalex.org/W2028957138","https://openalex.org/W2051280392","https://openalex.org/W2067151918","https://openalex.org/W2067754486","https://openalex.org/W2077578341","https://openalex.org/W2081999874","https://openalex.org/W2082387287","https://openalex.org/W2101230787","https://openalex.org/W2107815843","https://openalex.org/W2131662609","https://openalex.org/W2154987710","https://openalex.org/W2165132479","https://openalex.org/W2234020812","https://openalex.org/W2289135644","https://openalex.org/W2292587149","https://openalex.org/W2301555989","https://openalex.org/W2330024298","https://openalex.org/W2498386205","https://openalex.org/W2508435788","https://openalex.org/W2561139458","https://openalex.org/W2745754452","https://openalex.org/W2809427036","https://openalex.org/W2949331522","https://openalex.org/W3137859489","https://openalex.org/W4234761190","https://openalex.org/W4248083116","https://openalex.org/W4298314778"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2016058626","https://openalex.org/W1979597421","https://openalex.org/W2474724840","https://openalex.org/W2963760573","https://openalex.org/W2007980826","https://openalex.org/W185788778","https://openalex.org/W2895916002","https://openalex.org/W2061531152","https://openalex.org/W3182145356"],"abstract_inverted_index":{"We":[0],"show":[1,80],"that":[2,81],"for":[3,7,38,53,85,103,128,169],"several":[4],"solution":[5],"concepts":[6],"finite":[8],"n-player":[9,90],"games,":[10,91],"where":[11,92],"n":[12,93],"\u2265":[13,94],"3,":[14,95],"the":[15,26,30,34,82,86,100,104,108,123,133,138,142,146,170],"task":[16],"of":[17,29,33,71,107,116,122,141,145,157,172,175],"simply":[18],"verifying":[19],"its":[20],"conditions":[21],"is":[22,96],"computationally":[23],"equivalent":[24,98],"to":[25,99,126,137],"decision":[27,83,101,124,139],"problem":[28,84,102,140,171],"existential":[31,105,143],"theory":[32,106,144],"reals.":[35,109,147],"This":[36],"holds":[37],"trembling":[39,60],"hand":[40,61],"perfect":[41,62,72],"equilibrium,":[42,44,59,63],"proper":[43],"and":[45,52,64,162],"CURB":[46],"sets":[47],"in":[48,67,89],"strategic":[49],"form":[50,69],"games":[51,70],"(the":[54],"strategy":[55],"part":[56],"of)":[57],"sequential":[58],"quasi-perfect":[65],"equilibrium":[66],"extensive":[68],"recall.":[73],"For":[74],"obtaining":[75],"these":[76],"results":[77,111,115],"we":[78,151],"first":[79],"minmax":[87],"value":[88],"also":[97,152],"Our":[110],"thus":[112],"improve":[113],"previous":[114],"NP-hardness":[117],"as":[118,120],"well":[119],"Sqrt-Sum-hardness":[121],"problems":[125],"completeness":[127],"${\\exists":[129,165],"{\\mathbb":[130,166],"{R}}}$":[131,167],",":[132],"complexity":[134],"class":[135],"corresponding":[136],"As":[148],"a":[149,154,158,176],"byproduct":[150],"obtain":[153],"simpler":[155],"proof":[156],"result":[159],"by":[160],"Schaefer":[161],"\u0160tefankovi\u010d":[163],"giving":[164],"-completeness":[168],"deciding":[173],"existence":[174],"probability":[177],"constrained":[178],"Nash":[179],"equilibrium.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}