{"id":"https://openalex.org/W3198294619","doi":"https://doi.org/10.46298/lmcs-21(2:24)2025","title":"Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees","display_name":"Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees","publication_year":2025,"publication_date":"2025-06-17","ids":{"openalex":"https://openalex.org/W3198294619","doi":"https://doi.org/10.46298/lmcs-21(2:24)2025","mag":"3198294619"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(2:24)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:24)2025","pdf_url":"https://lmcs.episciences.org/15888/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","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15888/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052802261","display_name":"Zhuan Khye Koh","orcid":"https://orcid.org/0000-0002-4450-8506"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhuan Khye Koh","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5001022516","display_name":"Georg Loho","orcid":"https://orcid.org/0000-0001-6500-385X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Georg Loho","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00169506,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 21, Issue 2","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9970999956130981,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.995199978351593,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.6784099340438843},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5347304344177246},{"id":"https://openalex.org/keywords/power-iteration","display_name":"Power iteration","score":0.45807501673698425},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4462164044380188},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32806825637817383},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2716054916381836},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.21201112866401672},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07498669624328613}],"concepts":[{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.6784099340438843},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5347304344177246},{"id":"https://openalex.org/C162443888","wikidata":"https://www.wikidata.org/wiki/Q1426504","display_name":"Power iteration","level":3,"score":0.45807501673698425},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4462164044380188},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32806825637817383},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2716054916381836},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.21201112866401672},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07498669624328613},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.46298/lmcs-21(2:24)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:24)2025","pdf_url":"https://lmcs.episciences.org/15888/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:ris.utwente.nl:openaire/74589f97-b218-4a37-9524-854637ea9560","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/74589f97-b218-4a37-9524-854637ea9560","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Koh, Z K & Loho, G 2025, 'Beyond Value Iteration for Parity Games : Strategy Iteration with Universal Trees', Logical methods in computer science, vol. 21, no. 2. https://doi.org/10.46298/LMCS-21(2:24)2025","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:eprints.lse.ac.uk:116860","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Book Section"},{"id":"pmh:oai:arXiv.org:2108.13338","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2108.13338","pdf_url":"https://arxiv.org/pdf/2108.13338","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":"mag:3198294619","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2108.13338v1","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:2e1b4daafe214f57bdf5b189181c6af1","is_oa":true,"landing_page_url":"https://doaj.org/article/2e1b4daafe214f57bdf5b189181c6af1","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 21, Issue 2 (2025)","raw_type":"article"},{"id":"doi:10.4230/lipics.mfcs.2022.63","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2022.63","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(2:24)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:24)2025","pdf_url":"https://lmcs.episciences.org/15888/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/G1773082376","display_name":"Towards a Quantitative Theory of Integer Programming","funder_award_id":"805241","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4766913297","display_name":"Scaling Methods for Discrete and Continuous Optimization","funder_award_id":"757481","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320312710","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3198294619.pdf","grobid_xml":"https://content.openalex.org/works/W3198294619.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1536187134","https://openalex.org/W1977545325","https://openalex.org/W2017759899","https://openalex.org/W2075118512","https://openalex.org/W2169528473","https://openalex.org/W2170933628","https://openalex.org/W2401635679","https://openalex.org/W2586521831","https://openalex.org/W2883927050","https://openalex.org/W3011488982"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2962838298","https://openalex.org/W2600246793"],"abstract_inverted_index":{"Parity":[0],"games":[1],"have":[2,50],"witnessed":[3],"several":[4],"new":[5],"quasi-polynomial":[6,39],"algorithms":[7,80,159],"since":[8],"the":[9,43,71,87,129,142,161,169,179,193],"breakthrough":[10],"result":[11],"of":[12,45,73,86,146,156,163,172,183,192],"Calude":[13],"et":[14,32,185],"al.":[15,33,186],"(STOC":[16],"2017).":[17],"The":[18],"combinatorial":[19],"object":[20],"underlying":[21],"these":[22,79],"approaches":[23,61],"is":[24,68,111,136,150],"a":[25,38,46,52,83,98,153],"universal":[26,47,108,130,170,181],"tree,":[27,48],"as":[28,114,116],"identified":[29],"by":[30,58],"Czerwi\\'nski":[31],"(SODA":[34],"2019).":[35],"By":[36,166],"proving":[37],"lower":[40],"bound":[41],"on":[42,106],"size":[44],"they":[49],"highlighted":[51],"barrier":[53],"that":[54,196],"must":[55],"be":[56,104],"overcome":[57,93],"all":[59],"existing":[60],"to":[62,70,81,92,124,160],"attain":[63],"polynomial":[64],"running":[65],"time.":[66],"This":[67,149],"due":[69],"existence":[72],"worst":[74],"case":[75],"instances":[76],"which":[77,102],"force":[78],"explore":[82],"large":[84],"portion":[85],"tree.":[88,109,131],"As":[89],"an":[90,137],"attempt":[91],"this":[94],"barrier,":[95],"we":[96,189],"propose":[97],"strategy":[99],"iteration":[100,119],"framework":[101,195],"can":[103],"applied":[105],"any":[107],"It":[110],"at":[112],"least":[113,143],"fast":[115],"its":[117],"value":[118],"counterparts,":[120],"while":[121],"allowing":[122],"one":[123],"take":[125,197],"bigger":[126],"leaps":[127],"in":[128,168],"Our":[132],"main":[133],"technical":[134],"contribution":[135],"efficient":[138],"method":[139],"for":[140],"computing":[141],"fixed":[144],"point":[145],"1-player":[147],"games.":[148],"achieved":[151],"via":[152],"careful":[154],"adaptation":[155],"shortest":[157],"path":[158],"setting":[162],"ordered":[164],"trees.":[165],"plugging":[167],"tree":[171,182],"Jurdzi\\'nski":[173],"and":[174,202],"Lazi\\'c":[175],"(LICS":[176],"2017),":[177],"or":[178],"Strahler":[180],"Daviaud":[184],"(ICALP":[187],"2020),":[188],"obtain":[190],"instantiations":[191],"general":[194],"time":[198],"$O(mn^2\\log":[199],"n\\log":[200],"d)$":[201,206],"$O(mn^2\\log^3":[203],"n":[204],"\\log":[205],"respectively":[207],"per":[208],"iteration.":[209]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-11T18:08:03.149640","created_date":"2025-10-10T00:00:00"}