{"id":"https://openalex.org/W4387188014","doi":"https://doi.org/10.4204/eptcs.390.15","title":"Fast Algorithms for Energy Games in Special Cases","display_name":"Fast Algorithms for Energy Games in Special Cases","publication_year":2023,"publication_date":"2023-09-29","ids":{"openalex":"https://openalex.org/W4387188014","doi":"https://doi.org/10.4204/eptcs.390.15"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.390.15","doi":"https://doi.org/10.4204/eptcs.390.15","is_oa":true,"landing_page_url":"http://dx.doi.org/10.4204/eptcs.390.15","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2023.15.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-20"],"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2023.15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Sebastian Forster","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sebastian Forster","raw_affiliation_strings":["University of Salzburg","Department of Computer Science, University of Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Salzburg","institution_ids":["https://openalex.org/I182212641"]},{"raw_affiliation_string":"Department of Computer Science, University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073557610","display_name":"Antonis Skarlatos","orcid":"https://orcid.org/0000-0002-7623-9419","observed_orcids":["https://orcid.org/0000-0002-7623-9419"]},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Antonis Skarlatos","raw_affiliation_strings":["University of Salzburg","Department of Computer Science, University of Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Salzburg","institution_ids":["https://openalex.org/I182212641"]},{"raw_affiliation_string":"Department of Computer Science, University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079386151","display_name":"Tijn de Vos","orcid":"https://orcid.org/0000-0002-1417-6387","observed_orcids":["https://orcid.org/0000-0002-1417-6387"]},"institutions":[{"id":"https://openalex.org/I182212641","display_name":"University of Salzburg","ror":"https://ror.org/05gs8cd61","country_code":"AT","type":"education","lineage":["https://openalex.org/I182212641"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Tijn de Vos","raw_affiliation_strings":["University of Salzburg","Department of Computer Science, University of Salzburg, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Salzburg","institution_ids":["https://openalex.org/I182212641"]},{"raw_affiliation_string":"Department of Computer Science, University of Salzburg, Austria","institution_ids":["https://openalex.org/I182212641"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I182212641"],"apc_list":null,"apc_paid":null,"fwci":0.1789,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.330814,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"390","issue":null,"first_page":"236","last_page":"252"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6991999745368958,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6991999745368958,"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/T10142","display_name":"Formal Methods in Verification","score":0.19789999723434448,"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/T11567","display_name":"semigroups and automata theory","score":0.03739999979734421,"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/energy-games","display_name":"energy games","score":1.0},{"id":"https://openalex.org/keywords/conditional-lower-bounds","display_name":"conditional lower bounds","score":0.8090000152587891},{"id":"https://openalex.org/keywords/matrix-multiplication-exponent","display_name":"matrix multiplication exponent","score":0.7360000014305115},{"id":"https://openalex.org/keywords/nearly-linear-time-algorithms","display_name":"near-linear time algorithms","score":0.7820000052452087},{"id":"https://openalex.org/keywords/value-iteration","display_name":"value iteration","score":0.9369999766349792},{"id":"https://openalex.org/keywords/negative-cycles","display_name":"negative cycles","score":0.7509999871253967},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.39899998903274536}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5508947372436523},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.504044234752655},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.4661257266998291},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2146207094192505},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0496135950088501}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.4204/eptcs.390.15","doi":"https://doi.org/10.4204/eptcs.390.15","is_oa":true,"landing_page_url":"http://dx.doi.org/10.4204/eptcs.390.15","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2023.15.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-20"],"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2307.08442","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2307.08442","pdf_url":"https://arxiv.org/pdf/2307.08442","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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.2307.08442","doi":"https://doi.org/10.48550/arxiv.2307.08442","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2307.08442","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.4204/eptcs.390.15","doi":"https://doi.org/10.4204/eptcs.390.15","is_oa":true,"landing_page_url":"http://dx.doi.org/10.4204/eptcs.390.15","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF2023.15.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","norway-1","poland-20"],"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2380584944","display_name":"Dynamic Algorithms Against Strong Adversaries","funder_award_id":"947702","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G434337789","display_name":null,"funder_award_id":"HORIZON2020","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5833454457","display_name":null,"funder_award_id":"P 32863-N","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G8151294431","display_name":"Distributed Algorithms for Fundamental Graph Problems","funder_award_id":"P32863","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4387188014.pdf","grobid_xml":"https://content.openalex.org/works/W4387188014.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W106665802","https://openalex.org/W258058312","https://openalex.org/W1509653541","https://openalex.org/W1569998753","https://openalex.org/W1592208609","https://openalex.org/W1655990431","https://openalex.org/W1786377004","https://openalex.org/W1839854015","https://openalex.org/W1902461641","https://openalex.org/W1971499713","https://openalex.org/W1981670708","https://openalex.org/W2008632553","https://openalex.org/W2022980325","https://openalex.org/W2065595179","https://openalex.org/W2114657710","https://openalex.org/W2118382442","https://openalex.org/W2136442765","https://openalex.org/W2142133061","https://openalex.org/W2618199688","https://openalex.org/W2783940942","https://openalex.org/W2892948282","https://openalex.org/W2904346387","https://openalex.org/W2974787830","https://openalex.org/W2999201158","https://openalex.org/W3043364318","https://openalex.org/W4236251966","https://openalex.org/W4248784701","https://openalex.org/W4309134860","https://openalex.org/W4313227229","https://openalex.org/W4390097958","https://openalex.org/W6891717139","https://openalex.org/W7223723872"],"related_works":["https://openalex.org/W2795976437","https://openalex.org/W2904346387","https://openalex.org/W2792346428","https://openalex.org/W2966561082","https://openalex.org/W2528765492","https://openalex.org/W3207513582","https://openalex.org/W2805770938","https://openalex.org/W2065595179","https://openalex.org/W3140150357","https://openalex.org/W2153150472"],"abstract_inverted_index":{"In":[0,30],"this":[1,137],"paper,":[2],"we":[3,217,225,235,253,286,296,306],"study":[4,218],"algorithms":[5,143,334],"for":[6,136,144,177,213,223,246,269,315],"special":[7,146],"cases":[8,147],"of":[9,14,27,36,71,89,111,148,203,240,243,300],"energy":[10,32,65,88,99,117],"games,":[11],"a":[12,37,53,75,126,132,178,186,256,280,288,298,323],"class":[13],"turn":[15],"based":[16],"games":[17],"on":[18,156],"graphs":[19,317],"that":[20,262,308],"show":[21],"up":[22],"in":[23,115,120],"the":[24,34,57,69,72,84,87,90,98,113,149,157,166,189,199,210,219,238,241,250,275,301],"quantitative":[25],"analysis":[26],"reactive":[28],"systems.":[29],"an":[31,116,172,227,311],"game,":[33],"vertices":[35],"weighted":[38],"directed":[39],"graph":[40,180,282],"belong":[41],"either":[42,161],"to":[43,46,52,188],"Alice":[44,82,162],"or":[45,163],"Bob.":[47],"A":[48],"token":[49,91],"is":[50,66,125,198,209,264,330],"moved":[51],"next":[54],"vertex":[55,78],"by":[56,68,182,184,284],"player":[58],"controlling":[59],"its":[60,64],"current":[61],"location,":[62],"and":[63,79,207,305],"changed":[67],"weight":[70,206],"edge.":[73],"Given":[74],"fixed":[76],"starting":[77],"initial":[80],"energy,":[81],"wins":[83],"game":[85,118,168,179,281,316],"if":[86],"remains":[92],"nonnegative":[93],"at":[94,103],"every":[95],"moment.":[96],"If":[97],"goes":[100],"below":[101],"zero":[102],"some":[104],"point,":[105],"then":[106],"Bob":[107,164],"wins.":[108],"The":[109,151,327],"problem":[110,130,138,194,221],"determining":[112],"winner":[114],"lies":[119],"NP":[121],"intersection":[122],"coNP.":[123],"It":[124],"long":[127],"standing":[128],"open":[129],"whether":[131],"polynomial":[133],"time":[134,175,230,267,290,313],"algorithm":[135,176,268,314,329],"exists.":[139],"We":[140,170],"devise":[141],"new":[142],"three":[145],"problem.":[150],"first":[152],"two":[153],"results":[154],"focus":[155],"single-player":[158],"version,":[159],"where":[160,196],"controls":[165],"whole":[167],"graph.":[169],"develop":[171,226],"$\\tilde{O}(n^\\omega":[173,228],"W^\\omega)$":[174,229],"controlled":[181,283],"Alice,":[183],"providing":[185],"reduction":[187],"All-Pairs":[190],"Nonnegative":[191],"Prefix":[192],"Paths":[193],"(APNP),":[195],"$W$":[197],"maximum":[200],"absolute":[201],"value":[202,302],"any":[204,270],"edge":[205],"$\\omega$":[208],"best":[211],"exponent":[212],"matrix":[214],"multiplication.":[215],"Thus":[216],"APNP":[220,251],"separately,":[222],"which":[224,260,321],"algorithm.":[231,291],"For":[232,249,279],"both":[233],"problems,":[234],"improve":[236],"over":[237],"state":[239],"art":[242],"$\\tilde":[244],"O(mn)$":[245],"small":[247],"$W$.":[248],"problem,":[252],"also":[254],"provide":[255],"conditional":[257],"lower":[258],"bound":[259],"states":[261],"there":[263],"no":[265],"$O(n^{3-\\epsilon})$":[266],"$\\epsilon":[271],">":[272],"0$,":[273],"unless":[274],"APSP":[276],"Hypothesis":[277],"fails.":[278],"Bob,":[285],"obtain":[287],"near-linear":[289],"Regarding":[292],"our":[293],"third":[294],"result,":[295],"present":[297],"variant":[299],"iteration":[303],"algorithm,":[304],"prove":[307],"it":[309],"gives":[310],"$O(mn)$":[312],"without":[318],"negative":[319],"cycles,":[320],"improves":[322],"previous":[324],"upper":[325],"bound.":[326],"all-Bob":[328],"randomized,":[331],"all":[332],"other":[333],"are":[335],"deterministic.":[336]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2023-09-30T00:00:00"}
