{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:18Z","timestamp":1750220178860,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3532418","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Positionality in Games of Infinite Duration over Infinite Graphs"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Ohlmann","sequence":"first","affiliation":[{"name":"University of Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Benjamin Bordais Patricia Bouyer and St\u00e9phane\u00a0Le Roux. 2021. From local to global determinacy in concurrent graph games. CoRR abs\/2107.04081(2021). arxiv:2107.04081https:\/\/arxiv.org\/abs\/2107.04081  Benjamin Bordais Patricia Bouyer and St\u00e9phane\u00a0Le Roux. 2021. From local to global determinacy in concurrent graph games. CoRR abs\/2107.04081(2021). arxiv:2107.04081https:\/\/arxiv.org\/abs\/2107.04081"},{"volume-title":"FORMATS(Lecture Notes in Computer Science, Vol.\u00a05215)","author":"Bouyer Patricia","key":"e_1_3_2_1_2_1","unstructured":"Patricia Bouyer , Ulrich Fahrenberg , Kim\u00a0Guldstrand Larsen , Nicolas Markey , and Jir\u00ed Srba . 2008. Infinite Runs in Weighted Timed Automata with Energy Constraints . In FORMATS(Lecture Notes in Computer Science, Vol.\u00a05215) , Franck Cassez and Claude Jard (Eds.). Springer , 33\u201347. https:\/\/doi.org\/10.1007\/978-3-540-85778-5_4 10.1007\/978-3-540-85778-5_4 Patricia Bouyer, Ulrich Fahrenberg, Kim\u00a0Guldstrand Larsen, Nicolas Markey, and Jir\u00ed Srba. 2008. Infinite Runs in Weighted Timed Automata with Energy Constraints. In FORMATS(Lecture Notes in Computer Science, Vol.\u00a05215), Franck Cassez and Claude Jard (Eds.). Springer, 33\u201347. https:\/\/doi.org\/10.1007\/978-3-540-85778-5_4"},{"key":"e_1_3_2_1_3_1","first-page":"1","article-title":"Games Where You Can Play Optimally with Arena-Independent Finite Memory. In CONCUR(LIPIcs, Vol.\u00a0171)","volume":"24","author":"Bouyer Patricia","year":"2020","unstructured":"Patricia Bouyer , St\u00e9phane Le Roux , Youssouf Oualhadj , Mickael Randour , and Pierre Vandenhove . 2020 . Games Where You Can Play Optimally with Arena-Independent Finite Memory. In CONCUR(LIPIcs, Vol.\u00a0171) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 24 : 1 \u2013 24 :22. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.24 10.4230\/LIPIcs.CONCUR.2020.24 Patricia Bouyer, St\u00e9phane Le Roux, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. 2020. Games Where You Can Play Optimally with Arena-Independent Finite Memory. In CONCUR(LIPIcs, Vol.\u00a0171). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 24:1\u201324:22. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.24","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_4_1","volume-title":"St\u00e9phane Le Roux, and Nathan Thomasset","author":"Bouyer Patricia","year":"2021","unstructured":"Patricia Bouyer , St\u00e9phane Le Roux, and Nathan Thomasset . 2021 . Finite-memory strategies in two-player infinite games. CoRR abs\/2107.09945(2021). arxiv:2107.09945https:\/\/arxiv.org\/abs\/2107.09945 Patricia Bouyer, St\u00e9phane Le Roux, and Nathan Thomasset. 2021. Finite-memory strategies in two-player infinite games. CoRR abs\/2107.09945(2021). arxiv:2107.09945https:\/\/arxiv.org\/abs\/2107.09945"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Arena-Independent Finite-Memory Determinacy in Stochastic Games. In CONCUR(LIPIcs, Vol.\u00a0203)","volume":"26","author":"Bouyer Patricia","year":"2021","unstructured":"Patricia Bouyer , Youssouf Oualhadj , Mickael Randour , and Pierre Vandenhove . 2021 . Arena-Independent Finite-Memory Determinacy in Stochastic Games. In CONCUR(LIPIcs, Vol.\u00a0203) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 26 : 1 \u2013 26 :18. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.26 10.4230\/LIPIcs.CONCUR.2021.26 Patricia Bouyer, Youssouf Oualhadj, Mickael Randour, and Pierre Vandenhove. 2021. Arena-Independent Finite-Memory Determinacy in Stochastic Games. In CONCUR(LIPIcs, Vol.\u00a0203). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 26:1\u201326:18. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.26","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_6_1","unstructured":"Patricia Bouyer Mickael Randour and Pierre Vandenhove. 2021. Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. CoRR abs\/2110.01276(2021). https:\/\/arxiv.org\/abs\/2110.01276  Patricia Bouyer Mickael Randour and Pierre Vandenhove. 2021. Characterizing Omega-Regularity through Finite-Memory Determinacy of Games on Infinite Graphs. CoRR abs\/2110.01276(2021). https:\/\/arxiv.org\/abs\/2110.01276"},{"volume-title":"FCT(Lecture Notes in Computer Science, Vol.\u00a056)","author":"B\u00fcchi Richard","key":"e_1_3_2_1_7_1","unstructured":"J.\u00a0 Richard B\u00fcchi . 1977. Using Determinancy of Games to Eliminate Quantifiers . In FCT(Lecture Notes in Computer Science, Vol.\u00a056) . Springer , 367\u2013378. https:\/\/doi.org\/10.1007\/3-540-08442-8_104 10.1007\/3-540-08442-8_104 J.\u00a0Richard B\u00fcchi. 1977. Using Determinancy of Games to Eliminate Quantifiers. In FCT(Lecture Notes in Computer Science, Vol.\u00a056). Springer, 367\u2013378. https:\/\/doi.org\/10.1007\/3-540-08442-8_104"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1969-0280205-0"},{"key":"e_1_3_2_1_9_1","unstructured":"Antonio Casares. 2021. On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. CoRR abs\/2105.12009(2021). arxiv:2105.12009https:\/\/arxiv.org\/abs\/2105.12009  Antonio Casares. 2021. On the Minimisation of Transition-Based Rabin Automata and the Chromatic Memory Requirements of Muller Conditions. CoRR abs\/2105.12009(2021). arxiv:2105.12009https:\/\/arxiv.org\/abs\/2105.12009"},{"key":"e_1_3_2_1_10_1","unstructured":"Thomas Colcombet Nathana\u00ebl Fijalkow Pawel Gawrychowski and Pierre Ohlmann. 2021. The Theory of Universal Graphs for Infinite Duration Games. CoRR abs\/2104.05262(2021). arxiv:2104.05262https:\/\/arxiv.org\/abs\/2104.05262  Thomas Colcombet Nathana\u00ebl Fijalkow Pawel Gawrychowski and Pierre Ohlmann. 2021. The Theory of Universal Graphs for Infinite Duration Games. CoRR abs\/2104.05262(2021). arxiv:2104.05262https:\/\/arxiv.org\/abs\/2104.05262"},{"key":"#cr-split#-e_1_3_2_1_11_1.1","unstructured":"Thomas Colcombet Nathana\u00ebl Fijalkow and Florian Horn. 2014. Playing Safe. In FSTTCS(LIPIcs Vol.\u00a029). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik 379-390. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2014.379 10.4230\/LIPIcs.FSTTCS.2014.379"},{"key":"#cr-split#-e_1_3_2_1_11_1.2","unstructured":"Thomas Colcombet Nathana\u00ebl Fijalkow and Florian Horn. 2014. Playing Safe. In FSTTCS(LIPIcs Vol.\u00a029). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik 379-390. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2014.379"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.10.046"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1997.614939"},{"key":"e_1_3_2_1_14_1","unstructured":"A. Ehrenfeucht and J. Mycielski. 1973. Positional games over a graph. Notices of the American Mathematical Society 20 (1973) A\u2013334.  A. Ehrenfeucht and J. Mycielski. 1973. Positional games over a graph. Notices of the American Mathematical Society 20 (1973) A\u2013334."},{"volume-title":"Tree Automata, \u03bc-Calculus and Determinacy","author":"Emerson Allen","key":"e_1_3_2_1_15_1","unstructured":"E.\u00a0 Allen Emerson and Charanjit\u00a0 S. Jutla . 1991. Tree Automata, \u03bc-Calculus and Determinacy . In FOCS. IEEE Computer Society , 368\u2013377. E.\u00a0Allen Emerson and Charanjit\u00a0S. Jutla. 1991. Tree Automata, \u03bc-Calculus and Determinacy. In FOCS. IEEE Computer Society, 368\u2013377."},{"volume-title":"CONCUR(Lecture Notes in Computer Science, Vol.\u00a03653)","author":"Gimbert Hugo","key":"e_1_3_2_1_16_1","unstructured":"Hugo Gimbert and Wieslaw Zielonka . 2005. Games Where You Can Play Optimally Without Any Memory . In CONCUR(Lecture Notes in Computer Science, Vol.\u00a03653) . Springer , 428\u2013442. https:\/\/doi.org\/10.1007\/11539452_33 10.1007\/11539452_33 Hugo Gimbert and Wieslaw Zielonka. 2005. Games Where You Can Play Optimally Without Any Memory. In CONCUR(Lecture Notes in Computer Science, Vol.\u00a03653). Springer, 428\u2013442. https:\/\/doi.org\/10.1007\/11539452_33"},{"key":"e_1_3_2_1_17_1","volume-title":"Positional Determinacy of Games with Infinitely Many Priorities. Log. Methods Comput. Sci. 2, 4","author":"Gr\u00e4del Erich","year":"2006","unstructured":"Erich Gr\u00e4del and Igor Walukiewicz . 2006. Positional Determinacy of Games with Infinitely Many Priorities. Log. Methods Comput. Sci. 2, 4 ( 2006 ). https:\/\/doi.org\/10.2168\/LMCS-2(4:6)2006 10.2168\/LMCS-2(4:6)2006 Erich Gr\u00e4del and Igor Walukiewicz. 2006. Positional Determinacy of Games with Infinitely Many Priorities. Log. Methods Comput. Sci. 2, 4 (2006). https:\/\/doi.org\/10.2168\/LMCS-2(4:6)2006"},{"volume-title":"Automata, and Games(STOC)","author":"Gurevich Yuri","key":"e_1_3_2_1_18_1","unstructured":"Yuri Gurevich and Leo Harrington . 1982. Trees , Automata, and Games(STOC) . Association for Computing Machinery , 60\u201365. https:\/\/doi.org\/10.1145\/800070.802177 10.1145\/800070.802177 Yuri Gurevich and Leo Harrington. 1982. Trees, Automata, and Games(STOC). Association for Computing Machinery, 60\u201365. https:\/\/doi.org\/10.1145\/800070.802177"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185391"},{"key":"#cr-split#-e_1_3_2_1_20_1.1","doi-asserted-by":"crossref","unstructured":"Nils Klarlund. 1992. Progress Measures Immediate Determinacy and a Subset Construction for Tree Automata. In LICS. IEEE Computer Society 382-393. https:\/\/doi.org\/10.1109\/LICS.1992.185550 10.1109\/LICS.1992.185550","DOI":"10.1109\/LICS.1992.185550"},{"key":"#cr-split#-e_1_3_2_1_20_1.2","doi-asserted-by":"crossref","unstructured":"Nils Klarlund. 1992. Progress Measures Immediate Determinacy and a Subset Construction for Tree Automata. In LICS. IEEE Computer Society 382-393. https:\/\/doi.org\/10.1109\/LICS.1992.185550","DOI":"10.7146\/dpb.v21i430.7953"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Eryk Kopczy\u0144ski. 2006. Half-Positional Determinacy of Infinite Games. In ICALP. 336\u2013347.  Eryk Kopczy\u0144ski. 2006. Half-Positional Determinacy of Infinite Games. In ICALP. 336\u2013347.","DOI":"10.1007\/11787006_29"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90036-D"},{"key":"e_1_3_2_1_23_1","unstructured":"Pierre Ohlmann. 2022. Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. CoRR abs\/2205.04309(2022). https:\/\/arxiv.org\/abs\/2205.04309  Pierre Ohlmann. 2022. Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. CoRR abs\/2205.04309(2022). https:\/\/arxiv.org\/abs\/2205.04309"},{"key":"e_1_3_2_1_24_1","first-page":"1","article-title":"Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. In FSTTCS(LIPIcs, Vol.\u00a0122)","volume":"38","author":"Roux St\u00e9phane\u00a0Le","year":"2018","unstructured":"St\u00e9phane\u00a0Le Roux , Arno Pauly , and Mickael Randour . 2018 . Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. In FSTTCS(LIPIcs, Vol.\u00a0122) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 38 : 1 \u2013 38 :20. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2018.38 10.4230\/LIPIcs.FSTTCS.2018.38 St\u00e9phane\u00a0Le Roux, Arno Pauly, and Mickael Randour. 2018. Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. In FSTTCS(LIPIcs, Vol.\u00a0122). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 38:1\u201338:20. https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2018.38","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_25_1","volume-title":"Stochastic Games. 39, 10","author":"Shapley S.","year":"1953","unstructured":"L.\u00a0 S. Shapley . 1953. Stochastic Games. 39, 10 ( 1953 ), 1095\u20131100. https:\/\/doi.org\/10.1073\/pnas.39.10.1095 10.1073\/pnas.39.10.1095 L.\u00a0S. Shapley. 1953. Stochastic Games. 39, 10 (1953), 1095\u20131100. https:\/\/doi.org\/10.1073\/pnas.39.10.1095"},{"key":"e_1_3_2_1_26_1","volume-title":"Pushdown Processes: Games and Model Checking. In CAV(Lecture Notes in Computer Science, Vol.\u00a01102)","author":"Walukiewicz Igor","year":"1996","unstructured":"Igor Walukiewicz . 1996 . Pushdown Processes: Games and Model Checking. In CAV(Lecture Notes in Computer Science, Vol.\u00a01102) . Springer , 62\u201374. https:\/\/doi.org\/10.1007\/3-540-61474-5_58 10.1007\/3-540-61474-5_58 Igor Walukiewicz. 1996. Pushdown Processes: Games and Model Checking. In CAV(Lecture Notes in Computer Science, Vol.\u00a01102). Springer, 62\u201374. https:\/\/doi.org\/10.1007\/3-540-61474-5_58"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00009-7"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3532418","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3532418","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3532418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":29,"alternative-id":["10.1145\/3531130.3532418","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3532418","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}