Document Open Access Logo

Energy Games over Totally Ordered Groups

Author Alexander Kozachinskiy

PDF
Thumbnail PDF

File

LIPIcs.CSL.2024.34.pdf
  • Filesize: 0.68 MB
  • 12 pages

Document Identifiers

Author Details

Alexander Kozachinskiy
  • IMFD Chile & CENIA Chile, Santiago, Chile

Funding

  • Kozachinskiy, Alexander: the author is funded by ANID - Millennium Science Initiative Program - Code ICN17002, and the National Center for Artificial Intelligence CENIA FB210017, Basal ANID.

Cite As Get BibTex

Alexander Kozachinskiy. Energy Games over Totally Ordered Groups. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 288, pp. 34:1-34:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.CSL.2024.34

Abstract

Kopczyński (ICALP 2006) conjectured that prefix-independent half-positional winning conditions are closed under finite unions. We refute this conjecture over finite arenas. For that, we introduce a new class of prefix-independent bi-positional winning conditions called energy conditions over totally ordered groups. We give an example of two such conditions whose union is not half-positional. We also conjecture that every prefix-independent bi-positional winning condition coincides with some energy condition over a totally ordered group on periodic sequences.

Subject Classification

ACM Subject Classification
  • Theory of computation → Logic
Keywords
  • Games on graphs
  • half-positionality
  • ordered groups

Metrics

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

Related Versions

References

  1. Alessandro Bianco, Marco Faella, Fabio Mogavero, and Aniello Murano. Exploring the boundary of half-positionality. Annals of Mathematics and Artificial Intelligence, 62(1):55-77, 2011. Google Scholar
  2. Roderick Bloem, Krishnendu Chatterjee, and Barbara Jobstmann. Graph games and reactive synthesis. In Handbook of Model Checking, pages 921-962. Springer, 2018. Google Scholar
  3. Patricia Bouyer, Antonio Casares, Mickael Randour, and Pierre Vandenhove. Half-positional objectives recognized by deterministic büchi automata. In 33rd International Conference on Concurrency Theory (CONCUR 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022. Google Scholar
  4. Patricia Bouyer, Mickael Randour, and Pierre Vandenhove. Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs. TheoretiCS, 2(1):1-48, 2023. Google Scholar
  5. Arindam Chakrabarti, Luca de Alfaro, Thomas A Henzinger, and Mariëlle Stoelinga. Resource interfaces. In International Workshop on Embedded Software, pages 117-133. Springer, 2003. Google Scholar
  6. Thomas Colcombet and Damian Niwiński. Positional determinacy over finite games. Slides, available at https://www.irif.fr/~colcombe/Talks/talk_posdet_rennes_13.10.05.pdf, 2005. URL: https://www.irif.fr/~colcombe/Talks/talk_posdet_rennes_13.10.05.pdf.
  7. Thomas Colcombet and Damian Niwiński. On the positional determinacy of edge-labeled games. Theoretical Computer Science, 352(1-3):190-196, 2006. Google Scholar
  8. Bertrand Deroin, Andrés Navas, and Cristóbal Rivas. Groups, orders, and dynamics. arXiv preprint, 2014. URL: https://arxiv.org/abs/1408.5805.
  9. EA Emerson and CS Jutla. Tree automata, mu-calculus and determinacy. In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pages 368-377. IEEE, 1991. Google Scholar
  10. H Gimbert and E Kelmendi. Two-player perfect-information shift-invariant submixing stochastic games are half-positional. corr, abs/1401.6575. arXiv preprint, 2014. URL: https://arxiv.org/abs/1401.6575.
  11. Hugo Gimbert and Wiesław Zielonka. When can you play positionally? In International Symposium on Mathematical Foundations of Computer Science, pages 686-697. Springer, 2004. Google Scholar
  12. Hugo Gimbert and Wiesław Zielonka. Games where you can play optimally without any memory. In International Conference on Concurrency Theory, pages 428-442. Springer, 2005. Google Scholar
  13. Hugo Gimbert and Wiesław Zielonka. Deterministic priority mean-payoff games as limits of discounted games. In International Colloquium on Automata, Languages, and Programming, pages 312-323. Springer, 2006. Google Scholar
  14. Erich Grädel, Wolfgang Thomas, and Thomas Wilke. Automata, logics, and infinite games: a guide to current research, volume 2500. Springer, 2003. Google Scholar
  15. Eryk Kopczyński. Half-positional determinacy of infinite games. In International Colloquium on Automata, Languages, and Programming, pages 336-347. Springer, 2006. Google Scholar
  16. Alexander Kozachinskiy. Continuous Positional Payoffs. In Serge Haddad and Daniele Varacca, editors, 32nd International Conference on Concurrency Theory (CONCUR 2021), volume 203 of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1-10:17, Dagstuhl, Germany, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.CONCUR.2021.10.
  17. Pierre Ohlmann. Monotonic graphs for parity and mean-payoff games. PhD thesis, IRIF - Research Institute on the Foundations of Computer Science, 2021. Google Scholar
  18. Pierre Ohlmann. Characterizing positionality in games of infinite duration over infinite graphs. TheoretiCS, 2(3):1-51, 2023. Google Scholar
  19. H Shimbireva. On the theory of partially ordered groups. Matematicheskii Sbornik, 62(1):145-178, 1947. Google Scholar
  20. Wieslaw Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science, 200(1-2):135-183, 1998. 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 About DROPS Imprint Privacy Contact