{"id":"https://openalex.org/W4409138569","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-01","ids":{"openalex":"https://openalex.org/W4409138569","doi":"https://doi.org/10.23638/lmcs-14(4:9)2018"},"language":"en","primary_location":{"id":"pmh:oai:doaj.org/article:c667a766e89b4862ae7ae11a94b02dc0","is_oa":true,"landing_page_url":"https://doaj.org/article/c667a766e89b4862ae7ae11a94b02dc0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"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 14, Issue 4 (2018)","raw_type":"article"},"type":"article","indexed_in":["doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doaj.org/article/c667a766e89b4862ae7ae11a94b02dc0","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":false,"raw_author_name":"John Fearnley","raw_affiliation_strings":["San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","University of Liverpool, Liverpool, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","institution_ids":[]},{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","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":["ORCiD","San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","University of Liverpool, Liverpool, United Kingdom"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ORCiD","institution_ids":[]},{"raw_affiliation_string":"San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","institution_ids":[]},{"raw_affiliation_string":"University of Liverpool, Liverpool, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.3707372,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9300000071525574,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9300000071525574,"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/computer-science","display_name":"Computer science","score":0.6235514879226685}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6235514879226685}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:doaj.org/article:c667a766e89b4862ae7ae11a94b02dc0","is_oa":true,"landing_page_url":"https://doaj.org/article/c667a766e89b4862ae7ae11a94b02dc0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"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 14, Issue 4 (2018)","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:doaj.org/article:c667a766e89b4862ae7ae11a94b02dc0","is_oa":true,"landing_page_url":"https://doaj.org/article/c667a766e89b4862ae7ae11a94b02dc0","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"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 14, Issue 4 (2018)","raw_type":"article"},"sustainable_development_goals":[],"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"}],"funders":[{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1496590343","https://openalex.org/W1514240489","https://openalex.org/W1561093018","https://openalex.org/W1598325870","https://openalex.org/W1852734164","https://openalex.org/W1887255787","https://openalex.org/W1928484725","https://openalex.org/W1935571660","https://openalex.org/W1966347268","https://openalex.org/W2023067115","https://openalex.org/W2026128612","https://openalex.org/W2061874298","https://openalex.org/W2067768752","https://openalex.org/W2068290327","https://openalex.org/W2070970096","https://openalex.org/W2100114422","https://openalex.org/W2109237987","https://openalex.org/W2142133061","https://openalex.org/W2153460097","https://openalex.org/W2156268532","https://openalex.org/W2169359757","https://openalex.org/W2170933628","https://openalex.org/W2240422960","https://openalex.org/W2401635679","https://openalex.org/W2502103274","https://openalex.org/W2586521831","https://openalex.org/W2593234065","https://openalex.org/W2901579914","https://openalex.org/W2950091953","https://openalex.org/W3100558766","https://openalex.org/W3103084350","https://openalex.org/W3122185350","https://openalex.org/W4235083118","https://openalex.org/W4235295814","https://openalex.org/W4235914513","https://openalex.org/W4236123175","https://openalex.org/W4239254359","https://openalex.org/W4241584151","https://openalex.org/W4244848635","https://openalex.org/W4298023569"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"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-06-24T13:16:06.693445","created_date":"2025-10-10T00:00:00"}