{"id":"https://openalex.org/W2143874329","doi":"https://doi.org/10.2168/lmcs-7(3:20)2011","title":"The Complexity of Nash Equilibria in Stochastic Multiplayer Games","display_name":"The Complexity of Nash Equilibria in Stochastic Multiplayer Games","publication_year":2011,"publication_date":"2011-09-28","ids":{"openalex":"https://openalex.org/W2143874329","doi":"https://doi.org/10.2168/lmcs-7(3:20)2011","mag":"2143874329"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-7(3:20)2011","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-7(3:20)2011","pdf_url":"https://lmcs.episciences.org/1209/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1209/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002303742","display_name":"Michael Ummels","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":true,"raw_author_name":"Michael Ummels","raw_affiliation_strings":["RWTH Aachen University, Germany"],"affiliations":[{"raw_affiliation_string":"RWTH Aachen University, Germany","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001234060","display_name":"Dominik Wojtczak","orcid":"https://orcid.org/0000-0001-5560-0546"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Dominik Wojtczak","raw_affiliation_strings":["CWI Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002303742"],"corresponding_institution_ids":["https://openalex.org/I887968799"],"apc_list":null,"apc_paid":null,"fwci":3.8102,"has_fulltext":true,"cited_by_count":42,"citation_normalized_percentile":{"value":0.93251162,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"Volume 7, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game 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/T11031","display_name":"Game 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/T10142","display_name":"Formal Methods in Verification","score":0.9908000230789185,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.989799976348877,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8793390989303589},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.750126302242279},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.6979272365570068},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.627120852470398},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5412165522575378},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.509206235408783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5054311752319336},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49631673097610474},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.45252034068107605},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43547433614730835},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.43429821729660034},{"id":"https://openalex.org/keywords/epsilon-equilibrium","display_name":"Epsilon-equilibrium","score":0.4299360513687134},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.42567726969718933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42272526025772095},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.37234318256378174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3511713743209839},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34883248805999756},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.10844582319259644}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8793390989303589},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.750126302242279},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6979272365570068},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.627120852470398},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5412165522575378},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.509206235408783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5054311752319336},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49631673097610474},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.45252034068107605},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43547433614730835},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.43429821729660034},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.4299360513687134},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.42567726969718933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42272526025772095},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.37234318256378174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3511713743209839},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34883248805999756},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.10844582319259644},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.2168/lmcs-7(3:20)2011","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-7(3:20)2011","pdf_url":"https://lmcs.episciences.org/1209/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1109.4017","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1109.4017","pdf_url":"https://arxiv.org/pdf/1109.4017","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:cwi.nl:14933","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/14933","pdf_url":"https://ir.cwi.nl/pub/14933/14933B.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.396.9830","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.9830","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/UW-lmcs11.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.953.4513","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.953.4513","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://oai.cwi.nl/oai/asset/14933/14933B.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:4138022a71ab491fab9e121454c9a868","is_oa":true,"landing_page_url":"https://doaj.org/article/4138022a71ab491fab9e121454c9a868","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 7, Issue 3 (2011)","raw_type":"article"},{"id":"pmh:oai:publications.rwth-aachen.de:195146","is_oa":true,"landing_page_url":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-070540%22","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical methods in computer science : LMCS 7(3), 20 (2011). doi:10.2168/LMCS-7(3:20)2011","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.2168/lmcs-7(3:20)2011","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-7(3:20)2011","pdf_url":"https://lmcs.episciences.org/1209/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1151799532","display_name":null,"funder_award_id":"EP/G050112/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6414529594","display_name":null,"funder_award_id":"EP/G050112/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2143874329.pdf","grobid_xml":"https://content.openalex.org/works/W2143874329.grobid-xml"},"referenced_works_count":65,"referenced_works":["https://openalex.org/W163703497","https://openalex.org/W1480317510","https://openalex.org/W1496590343","https://openalex.org/W1498432697","https://openalex.org/W1502195915","https://openalex.org/W1514240489","https://openalex.org/W1536187134","https://openalex.org/W1560050980","https://openalex.org/W1579971638","https://openalex.org/W1589508846","https://openalex.org/W1667094241","https://openalex.org/W1807884544","https://openalex.org/W1964905826","https://openalex.org/W1966347268","https://openalex.org/W1971138850","https://openalex.org/W1972203711","https://openalex.org/W1973023438","https://openalex.org/W1982429087","https://openalex.org/W1991624978","https://openalex.org/W2002373723","https://openalex.org/W2005998857","https://openalex.org/W2017194981","https://openalex.org/W2020293036","https://openalex.org/W2038680194","https://openalex.org/W2040721698","https://openalex.org/W2043507528","https://openalex.org/W2056545661","https://openalex.org/W2057913812","https://openalex.org/W2058277150","https://openalex.org/W2059837071","https://openalex.org/W2060375000","https://openalex.org/W2066194644","https://openalex.org/W2067050450","https://openalex.org/W2067754486","https://openalex.org/W2078718677","https://openalex.org/W2089546742","https://openalex.org/W2090603514","https://openalex.org/W2105702545","https://openalex.org/W2106141493","https://openalex.org/W2106790957","https://openalex.org/W2112476716","https://openalex.org/W2120360673","https://openalex.org/W2121431238","https://openalex.org/W2127182849","https://openalex.org/W2128480458","https://openalex.org/W2141252092","https://openalex.org/W2142133061","https://openalex.org/W2152720531","https://openalex.org/W2153358971","https://openalex.org/W2155388558","https://openalex.org/W2158437920","https://openalex.org/W2167359460","https://openalex.org/W2170933628","https://openalex.org/W2240543079","https://openalex.org/W2502103274","https://openalex.org/W2575731723","https://openalex.org/W2792090629","https://openalex.org/W3082353674","https://openalex.org/W4210896998","https://openalex.org/W4211045823","https://openalex.org/W4231388768","https://openalex.org/W4243443766","https://openalex.org/W4249618263","https://openalex.org/W4255368532","https://openalex.org/W4312534390"],"related_works":["https://openalex.org/W1503991720","https://openalex.org/W2160501251","https://openalex.org/W2098677925","https://openalex.org/W1853631319","https://openalex.org/W4234189135","https://openalex.org/W4241202187","https://openalex.org/W1786478901","https://openalex.org/W2092374696","https://openalex.org/W1528032490","https://openalex.org/W4295847115"],"abstract_inverted_index":{"We":[0,17],"analyse":[1],"the":[2,21,42,90,95,103,133,150,175],"computational":[3],"complexity":[4,104],"of":[5,57,89,105,115,120,132,152,177,190],"finding":[6],"Nash":[7,55],"equilibria":[8,25],"in":[9,137,155,169],"turn-based":[10],"stochastic":[11],"multiplayer":[12],"games":[13,173],"with":[14,63,79,163,186],"omega-regular":[15],"objectives.":[16],"show":[18],"that":[19,41,148],"restricting":[20],"search":[22],"space":[23],"to":[24,35,73,84,93,97],"whose":[26],"payoffs":[27],"fall":[28],"into":[29],"a":[30,48,54,86,111,129,183,187],"certain":[31],"interval":[32],"may":[33],"lead":[34],"undecidability.":[36],"In":[37,144],"particular,":[38,145],"we":[39,109,126,146],"prove":[40,147],"following":[43],"problem":[44,68,91,135],"is":[45,92,180],"undecidable:":[46],"Given":[47],"game":[49],"G,":[50],"does":[51],"there":[52],"exist":[53],"equilibrium":[56,154],"G":[58],"where":[59,174],"Player":[60],"0":[61],"wins":[62,160],"probability":[64,164],"1?":[65],"Moreover,":[66],"this":[67],"remains":[69],"undecidable":[70],"when":[71],"restricted":[72],"pure":[74],"strategies":[75,78,96],"or":[76,100,161],"(pure)":[77],"finite":[80],"memory.":[81],"One":[82],"way":[83],"obtain":[85,110],"decidable":[87],"variant":[88],"restrict":[94],"be":[98,167],"positional":[99],"stationary.":[101],"For":[102],"these":[106],"two":[107],"problems,":[108],"common":[112],"lower":[113],"bound":[114],"NP":[116,121],"and":[117,122],"upper":[118],"bounds":[119],"PSPACE":[123],"respectively.":[124],"Finally,":[125],"single":[127],"out":[128],"special":[130],"case":[131],"general":[134],"that,":[136],"many":[138],"cases,":[139],"admits":[140],"an":[141,153],"efficient":[142],"solution.":[143],"deciding":[149],"existence":[151],"which":[156],"each":[157,178],"player":[158,179],"either":[159],"loses":[162],"1":[165],"can":[166],"done":[168],"polynomial":[170],"time":[171],"for":[172],"objective":[176],"given":[181],"by":[182],"parity":[184],"condition":[185],"bounded":[188],"number":[189],"priorities.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}