Document Open Access Logo

Positionality in Σ⁰₂ and a Completeness Result

Authors Pierre Ohlmann , Michał Skrzypczak

PDF
Thumbnail PDF

File

LIPIcs.STACS.2024.54.pdf
  • Filesize: 0.79 MB
  • 18 pages

Document Identifiers

Author Details

Pierre Ohlmann
  • Institute of Informatics, University of Warsaw, Poland
Michał Skrzypczak
  • Institute of Informatics, University of Warsaw, Poland

Funding

  • Ohlmann, Pierre: Author supported by the European Research Council (grant agreement No 948057 - BOBR).
  • Skrzypczak, Michał: Author supported by the National Science Centre, Poland (grant no. 2021/41/B/ST6/03914).

Acknowledgements

We thank Antonio Casares and Lorenzo Clemente for discussions on and around the topic.

Cite AsGet BibTex

Pierre Ohlmann and Michał Skrzypczak. Positionality in Σ⁰₂ and a Completeness Result. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 54:1-54:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.STACS.2024.54

Abstract

We study the existence of positional strategies for the protagonist in infinite duration games over arbitrary game graphs. We prove that prefix-independent objectives in Σ⁰₂ which are positional and admit a (strongly) neutral letter are exactly those that are recognised by history-deterministic monotone co-Büchi automata over countable ordinals. This generalises a criterion proposed by [Kopczyński, ICALP 2006] and gives an alternative proof of closure under union for these objectives, which was known from [Ohlmann, TheoretiCS 2023]. We then give two applications of our result. First, we prove that the mean-payoff objective is positional over arbitrary game graphs. Second, we establish the following completeness result: for any objective W which is prefix-independent, admits a (weakly) neutral letter, and is positional over finite game graphs, there is an objective W' which is equivalent to W over finite game graphs and positional over arbitrary game graphs.

Subject Classification

ACM Subject Classification
  • Theory of computation → Automata over infinite objects
Keywords
  • infinite duration games
  • positionality
  • Borel class Σ⁰₂
  • history determinism

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Udi Boker, Orna Kupferman, and Michał Skrzypczak. How deterministic are good-for-games automata? In FSTTCS, volume 93 of LIPIcs, pages 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2017.18.
  2. Patricia Bouyer, Antonio Casares, Mickael Randour, and Pierre Vandenhove. Half-positional objectives recognized by deterministic büchi automata. In Bartek Klin, Slawomir Lasota, and Anca Muscholl, editors, 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, volume 243 of LIPIcs, pages 20:1-20:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.CONCUR.2022.20.
  3. Lubos Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini, and Jean-François Raskin. Faster algorithms for mean-payoff games. Formal Methods Syst. Des., 38(2):97-118, 2011. URL: https://doi.org/10.1007/s10703-010-0105-x.
  4. Antonio Casares. Structural properties of ω-automata and strategy complexity in infinite duration games. PhD thesis, Université de Bordeaux, 2023. Google Scholar
  5. Antonio Casares and Pierre Ohlmann. Characterising memory in infinite games. CoRR, abs/2209.12044, 2022. URL: https://doi.org/10.48550/arXiv.2209.12044.
  6. Thomas Colcombet. Forms of determinism for automata (invited talk). In STACS, volume 14 of LIPIcs, pages 1-23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2012. URL: https://doi.org/10.4230/LIPIcs.STACS.2012.1.
  7. Thomas Colcombet and Damian Niwiński. On the positional determinacy of edge-labeled games. Theor. Comput. Sci., 352(1-3):190-196, 2006. URL: https://doi.org/10.1016/j.tcs.2005.10.046.
  8. Morton Davis. Infinite games of perfect information. In Advances in game theory, pages 85-101. Princeton Univ. Press, Princeton, N.J., 1964. Google Scholar
  9. Andrzej Ehrenfeucht and Jan Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory, 109(8):109-113, 1979. URL: https://doi.org/10.1007/BF01768705.
  10. E. Allen Emerson and Charanjit S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pages 368-377. IEEE Computer Society, 1991. URL: https://doi.org/10.1109/SFCS.1991.185392.
  11. Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, and Mateusz Skomra. Games on Graphs. Online, 2023. Google Scholar
  12. David Gale and Frank M. Stewart. Infinite games with perfect information. In Contributions to the theory of games, volume 2 of Annals of Mathematics Studies, no. 28, pages 245-266. Princeton University Press, 1953. Google Scholar
  13. Hugo Gimbert. Parity and exploration games on infinite graphs. In Jerzy Marcinkowski and Andrzej Tarlecki, editors, Computer Science Logic, 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 20-24, 2004, Proceedings, volume 3210 of Lecture Notes in Computer Science, pages 56-70. Springer, 2004. URL: https://doi.org/10.1007/978-3-540-30124-0_8.
  14. Hugo Gimbert and Wiesław Zielonka. Games where you can play optimally without any memory. In CONCUR, volume 3653 of Lecture Notes in Computer Science, pages 428-442. Springer, 2005. URL: https://doi.org/10.1007/11539452_33.
  15. Simon Iosti and Denis Kuperberg. Eventually safe languages. In Piotrek Hofman and Michał Skrzypczak, editors, Developments in Language Theory - 23rd International Conference, DLT 2019, Warsaw, Poland, August 5-9, 2019, Proceedings, volume 11647 of Lecture Notes in Computer Science, pages 192-205. Springer, 2019. URL: https://doi.org/10.1007/978-3-030-24886-4_14.
  16. Alexander Kechris. Classical descriptive set theory. Springer-Verlag, New York, 1995. Google Scholar
  17. Eryk Kopczyński. Half-positional determinacy of infinite games. In ICALP, volume 4052 of Lecture Notes in Computer Science, pages 336-347. Springer, 2006. URL: https://doi.org/10.1007/11787006_29.
  18. Eryk Kopczyński. Half-positional determinacy of infinite games. PhD thesis, University of Warsaw, 2009. URL: https://www.mimuw.edu.pl/~erykk/papers/hpwc.pdf.
  19. Alexander Kozachinskiy. Energy games over totally ordered groups. CoRR, abs/2205.04508, 2022. URL: https://doi.org/10.48550/arXiv.2205.04508.
  20. Denis Kuperberg and Michał Skrzypczak. On determinisation of good-for-games automata. In ICALP, volume 9135 of Lecture Notes in Computer Science, pages 299-310. Springer, 2015. URL: https://doi.org/10.1007/978-3-662-47666-6_24.
  21. Donald A. Martin. Borel determinacy. Annals of Mathematics, 102(2):363-371, 1975. Google Scholar
  22. Andrzej W. Mostowski. Games with forbidden positions. Technical Report 78, University of Gdansk, 1991. Google Scholar
  23. Pierre Ohlmann. Monotone graphs for solving parity and mean-payoff games. PhD thesis, Université de Paris, 2021. Google Scholar
  24. Pierre Ohlmann. Characterizing Positionality in Games of Infinite Duration over Infinite Graphs. TheoretiCS, Volume 2, January 2023. URL: https://doi.org/10.46298/theoretics.23.3.
  25. Pierre Ohlmann. Positionality of mean-payoff games on infinite graphs, 2023. URL: https://arxiv.org/abs/2305.00347.
  26. Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1-35, 1969. URL: http://www.jstor.org/stable/1995086.
  27. Bader Abu Radi and Orna Kupferman. Minimization and canonization of GFG transition-based automata. Log. Methods Comput. Sci., 18(3), 2022. URL: https://doi.org/10.46298/lmcs-18(3:16)2022.
  28. Lloyd S. Shapley. Stochastic games. Proceedings of the National Academy of Sciences, 39(10):1095-1100, 1953. URL: https://doi.org/10.1073/pnas.39.10.1095.
  29. Michał Skrzypczak. Topological extension of parity automata. Information and Computation, 228:16-27, 2013. Google Scholar
  30. Philip Wolfe. The strict determinateness of certain infinite games. Pacific Journal of Mathematics, 5:841-847, 1955. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact