{"id":"https://openalex.org/W2952502931","doi":"https://doi.org/10.23638/lmcs-14(4:9)2018","title":"The Complexity of All-switches Strategy Improvement","display_name":"The Complexity of All-switches Strategy Improvement","publication_year":2018,"publication_date":"2018-10-31","ids":{"openalex":"https://openalex.org/W2952502931","doi":"https://doi.org/10.23638/lmcs-14(4:9)2018","mag":"2952502931"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-14(4:9)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:9)2018","pdf_url":"https://lmcs.episciences.org/4940/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":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/4940/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029623300","display_name":"John Fearnley","orcid":"https://orcid.org/0000-0003-0791-4342"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"John Fearnley","raw_affiliation_strings":["University of Liverpool , Liverpool , United Kingdom San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany"],"affiliations":[{"raw_affiliation_string":"University of Liverpool , Liverpool , United Kingdom San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084692264","display_name":"Rahul Savani","orcid":"https://orcid.org/0000-0003-1262-7831"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rahul Savani","raw_affiliation_strings":["University of Liverpool , Liverpool , United Kingdom San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","ORCiD"],"affiliations":[{"raw_affiliation_string":"University of Liverpool , Liverpool , United Kingdom San Francisco , CA 94105 , USA , or Eisenacher Strasse 2 , 10777 Berlin , Germany","institution_ids":["https://openalex.org/I146655781"]},{"raw_affiliation_string":"ORCiD","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5029623300"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22831221,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 14, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9951000213623047,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5844284296035767},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.5810920596122742},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4540856182575226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42686256766319275},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4201195240020752},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4106611907482147},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3006814122200012},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.13826677203178406}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5844284296035767},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.5810920596122742},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4540856182575226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42686256766319275},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4201195240020752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4106611907482147},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3006814122200012},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.13826677203178406}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-14(4:9)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:9)2018","pdf_url":"https://lmcs.episciences.org/4940/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:1507.04500","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.04500","pdf_url":"https://arxiv.org/pdf/1507.04500","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1507.04500","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1507.04500","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-14(4:9)2018","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-14(4:9)2018","pdf_url":"https://lmcs.episciences.org/4940/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":[{"display_name":"Peace, Justice and strong institutions","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G6410415320","display_name":null,"funder_award_id":"EP/L011018/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"},{"id":"https://openalex.org/G8639667597","display_name":null,"funder_award_id":"EP/L011018/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2952502931.pdf","grobid_xml":"https://content.openalex.org/works/W2952502931.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1496590343","https://openalex.org/W1514240489","https://openalex.org/W1561093018","https://openalex.org/W1598325870","https://openalex.org/W1928484725","https://openalex.org/W1965258835","https://openalex.org/W1966347268","https://openalex.org/W2017759899","https://openalex.org/W2044413922","https://openalex.org/W2061874298","https://openalex.org/W2067768752","https://openalex.org/W2068290327","https://openalex.org/W2069058599","https://openalex.org/W2070970096","https://openalex.org/W2075654027","https://openalex.org/W2100114422","https://openalex.org/W2103981148","https://openalex.org/W2109237987","https://openalex.org/W2114598978","https://openalex.org/W2119567691","https://openalex.org/W2142133061","https://openalex.org/W2152479402","https://openalex.org/W2153460097","https://openalex.org/W2156268532","https://openalex.org/W2169359757","https://openalex.org/W2170933628","https://openalex.org/W2240422960","https://openalex.org/W2249369553","https://openalex.org/W2401635679","https://openalex.org/W2404448755","https://openalex.org/W2586521831","https://openalex.org/W2951283899","https://openalex.org/W2962713740","https://openalex.org/W3103084350","https://openalex.org/W3122185350"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W1494268238","https://openalex.org/W154868527","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W4255576661","https://openalex.org/W1516574938","https://openalex.org/W2563912921","https://openalex.org/W1494664245"],"abstract_inverted_index":{"Strategy":[0],"improvement":[1,53,101,131,163,187],"is":[2,30,92,104,117,127,134],"a":[3,20,44,72,75,215],"widely-used":[4],"and":[5,23,79,149,167,176,179],"well-studied":[6],"class":[7],"of":[8,25,47,57,67,144,165,193,208],"algorithms":[9,16],"for":[10,153,200,204],"solving":[11],"graph-based":[12],"infinite":[13],"games.":[14],"These":[15],"are":[17],"parameterized":[18],"by":[19,98,129],"switching":[21],"rule,":[22],"one":[24],"the":[26,55,93,118,123,145,154,160,172,201,206],"most":[27],"natural":[28,63],"rules":[29],""all":[31],"switches"":[32],"which":[33,68],"switches":[34],"as":[35,38,70],"many":[36],"edges":[37],"possible":[39],"in":[40,122],"each":[41],"iteration.":[42],"Continuing":[43],"recent":[45],"line":[46],"work,":[48],"we":[49],"study":[50],"all-switches":[51,99],"strategy":[52,77,100,114,125,130,151,162,186],"from":[54,106,136],"perspective":[56],"computational":[58],"complexity.":[59],"We":[60,141,189],"consider":[61],"two":[62],"decision":[64],"problems,":[65],"both":[66],"have":[69],"input":[71],"game":[73,109,139],"$G$,":[74],"starting":[76],"$s$,":[78],"an":[80,194,209],"edge":[81,88,94,119,146,198],"$e$.":[82],"The":[83,87,112],"problems":[84],"are:":[85],"1.)":[86],"switch":[89,147,199],"problem,":[90,115],"namely,":[91,116],"$e$":[95,120],"ever":[96],"switched":[97],"when":[102,132],"it":[103,133],"started":[105,135],"$s$":[107,137],"on":[108,138,214],"$G$?":[110,140],"2.)":[111],"optimal":[113,150],"used":[121],"final":[124],"that":[126],"found":[128],"show":[142,191],"$\\mathtt{PSPACE}$-completeness":[143,192],"problem":[148,152,196],"following":[155],"settings:":[156],"Parity":[157],"games":[158,170,178,182],"with":[159,171,183],"discrete":[161],"algorithm":[164,174,203],"V\\"oge":[166],"Jurdzi\\'nski;":[168],"mean-payoff":[169],"gain-bias":[173],"[14,37];":[175],"discounted-payoff":[177],"simple":[180],"stochastic":[181],"their":[184],"standard":[185],"algorithms.":[188],"also":[190],"analogous":[195],"to":[197],"bottom-antipodal":[202],"finding":[205],"sink":[207],"Acyclic":[210],"Unique":[211],"Sink":[212],"Orientation":[213],"cube.":[216]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}