Document Open Access Logo

Games with ω-Automatic Preference Relations

Authors Véronique Bruyère , Christophe Grandmont , Jean-François Raskin

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2025.31.pdf
  • Filesize: 1.11 MB
  • 19 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Automata over infinite objects
  • Software and its engineering → Formal methods
  • Theory of computation → Solution concepts in game theory
  • Theory of computation → Exact and approximate computation of equilibria
Keywords
  • Games played on graphs
  • Nash equilibrium
  • ω-automatic relations
  • ω-recognizable relations
  • constrained Nash equilibria existence problem

Metrics

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

Abstract

This paper investigates Nash equilibria (NEs) in multi-player turn-based games on graphs, where player preferences are modeled as ω-automatic relations via deterministic parity automata. Unlike much of the existing literature, which focuses on specific reward functions, our results apply to any preference relation definable by an ω-automatic relation. We analyze the computational complexity of determining the existence of an NE (possibly under some constraints), verifying whether a given strategy profile forms an NE, and checking whether a specific outcome can be realized by an NE. When a (constrained) NE exists, we show that there always exists one with finite-memory strategies. Finally, we explore fundamental properties of ω-automatic relations and their implications in the existence of equilibria.

Cite As Get BibTex

Véronique Bruyère, Christophe Grandmont, and Jean-François Raskin. Games with ω-Automatic Preference Relations. In 50th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 345, pp. 31:1-31:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.MFCS.2025.31

Author Details

Véronique Bruyère
  • Université de Mons (UMONS), Belgium
Christophe Grandmont
  • Université de Mons (UMONS), Belgium
  • Université libre de Bruxelles (ULB), Belgium
Jean-François Raskin
  • Université libre de Bruxelles (ULB), Belgium

Funding

This work has been supported by the Fonds de la Recherche Scientifique – FNRS under Grant n° T.0023.22 (PDR Rational).
  • Raskin, Jean-François: Supported by Fondation ULB (https://www.fondationulb.be/en/) and the Thelam Fondation.

References

  1. Christel Baier and Joost-Pieter Katoen. Principles of model checking. MIT Press, 2008. Google Scholar
  2. Suguman Bansal, Swarat Chaudhuri, and Moshe Y. Vardi. Comparator automata in quantitative verification. Logical Methods in Computer Science, Volume 18, Issue 3, July 2022. URL: https://doi.org/10.46298/lmcs-18(3:13)2022.
  3. Pascal Bergsträßer and Moses Ganardi. Revisiting Membership Problems in Subclasses of Rational Relations. In 38th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2023, Boston, MA, USA, June 26-29, 2023, pages 1-14. IEEE, 2023. URL: https://doi.org/10.1109/LICS56636.2023.10175722.
  4. Dietmar Berwanger and Laurent Doyen. Observation and Distinction: Representing Information in Infinite Games. Theory of Computing Systems, 67(1):4-27, 2023. URL: https://doi.org/10.1007/s00224-021-10044-x.
  5. Achim Blumensath and Erich Grädel. Automatic structures. In 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, USA, June 26-29, 2000, pages 51-62. IEEE Computer Society, 2000. URL: https://doi.org/10.1109/lics.2000.855755.
  6. Patricia Bouyer, Romain Brenguier, and Nicolas Markey. Nash Equilibria for Reachability Objectives in Multi-player Timed Games. In Paul Gastin and François Laroussinie, editors, CONCUR 2010 - Concurrency Theory, 21th International Conference, CONCUR 2010, Paris, France, August 31-September 3, 2010. Proceedings, volume 6269 of Lecture Notes in Computer Science, pages 192-206. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15375-4_14.
  7. Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Pure Nash Equilibria in Concurrent Deterministic Games. Logical Methods in Computer Science, 11(2), 2015. URL: https://doi.org/10.2168/lmcs-11(2:9)2015.
  8. Laura Bozzelli, Bastien Maubert, and Sophie Pinchinat. Uniform strategies, rational relations and jumping automata. Information and Computation, 242, 2015. URL: https://doi.org/10.1016/j.ic.2015.03.012.
  9. Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, and Mathieu Sassolas. Non-Zero Sum Games for Reactive Synthesis. In Adrian-Horia Dediu, Jan Janousek, Carlos Martín-Vide, and Bianca Truthe, editors, Language and Automata Theory and Applications - 10th International Conference, LATA 2016, Prague, Czech Republic, March 14-18, 2016, Proceedings, volume 9618 of Lecture Notes in Computer Science, pages 3-23. Springer, 2016. URL: https://doi.org/10.1007/978-3-319-30000-9_1.
  10. Léonard Brice, Jean-François Raskin, and Marie van den Bogaard. Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games. In Jérôme Leroux, Sylvain Lombardy, and David Peleg, editors, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, volume 272 of LIPIcs, pages 26:1-26:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/lipics.mfcs.2023.26.
  11. Léonard Brice, Marie van den Bogaard, and Jean-François Raskin. Subgame-perfect Equilibria in Mean-payoff Games (journal version). Logical Methods in Computer Science, 19(4), 2023. URL: https://doi.org/10.46298/lmcs-19(4:6)2023.
  12. Thomas Brihaye, Julie De Pril, and Sven Schewe. Multiplayer Cost Games with Simple Nash Equilibria. In Sergei N. Artëmov and Anil Nerode, editors, Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings, volume 7734 of Lecture Notes in Computer Science, pages 59-73. Springer, 2013. URL: https://doi.org/10.1007/978-3-642-35722-0_5.
  13. Véronique Bruyère. Computer Aided Synthesis: A Game-Theoretic Approach. In Émilie Charlier, Julien Leroy, and Michel Rigo, editors, Developments in Language Theory - 21st International Conference, DLT 2017, Liège, Belgium, August 7-11, 2017, Proceedings, volume 10396 of Lecture Notes in Computer Science, pages 3-35. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-62809-7_1.
  14. Véronique Bruyère. Synthesis of Equilibria in Infinite-Duration Games on Graphs. ACM SIGLOG News, 8(2):4-29, May 2021. URL: https://doi.org/10.1145/3467001.3467003.
  15. Véronique Bruyère, Christophe Grandmont, and Jean-François Raskin. Games with ω-Automatic Preference Relations. CoRR, abs/2503.04759, 2025. URL: https://doi.org/10.48550/arXiv.2503.04759.
  16. Véronique Bruyère, Jean-François Raskin, Alexis Reynouard, and Marie Van Den Bogaard. The Non-Cooperative Rational Synthesis Problem for Subgame Perfect Equilibria and omega-regular Objectives, 2024. URL: https://doi.org/10.48550/arxiv.2412.08547.
  17. Olivier Carton, Christian Choffrut, and Serge Grigorieff. Decision problems among the main subfamilies of rational relations. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, 40(2):255-275, 2006. URL: https://doi.org/10.1051/ita:2006005.
  18. Krishnendu Chatterjee, Thomas A. Henzinger, and Nir Piterman. Generalized Parity Games. In Helmut Seidl, editor, Foundations of Software Science and Computational Structures, 10th International Conference, FOSSACS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007, Braga, Portugal, March 24-April 1, 2007, Proceedings, volume 4423 of Lecture Notes in Computer Science, pages 153-167. Springer, 2007. URL: https://doi.org/10.1007/978-3-540-71389-0_12.
  19. Krishnendu Chatterjee and Vishwanath Raman. Synthesizing Protocols for Digital Contract Signing. In Viktor Kuncak and Andrey Rybalchenko, editors, Verification, Model Checking, and Abstract Interpretation - 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012. Proceedings, volume 7148 of Lecture Notes in Computer Science, pages 152-168. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-27940-9_11.
  20. Yoav Feinstein, Orna Kupferman, and Noam Shenwald. Non-Zero-Sum Games with Multiple Weighted Objectives. In Proceedings of the 28th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2025), volume To appear of Lecture Notes in Computer Science, page To appear. Springer, 2025. URL: https://www.cs.huji.ac.il/~ornak/publications/tacas25b.pdf.
  21. 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. URL: https://doi.org/10.48550/arxiv.2305.10546.
  22. János Flesch, Jeroen Kuipers, Ayala Mashiah-Yaakovi, Gijs Schoenmakers, Eilon Solan, and Koos Vrieze. Perfect-Information Games with Lower-Semicontinuous Payoffs. Mathematics of Operations Research, 35(4):742-755, 2010. URL: https://doi.org/10.1287/moor.1100.0469.
  23. Christiane Frougny and Jacques Sakarovitch. Synchronized rational relations of finite and infinite words. Theoretical Computer Science, 108(1):45-82, 1993. URL: https://doi.org/10.1016/0304-3975(93)90230-Q.
  24. M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. URL: https://perso.limos.fr/~palafour/PAPERS/PDF/Garey-Johnson79.pdf.
  25. Erich Grädel. Automatic Structures: Twenty Years Later. In Holger Hermanns, Lijun Zhang, Naoki Kobayashi, and Dale Miller, editors, LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020, LICS'20, pages 21-34, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3373718.3394734.
  26. Erich Grädel, Wolfgang Thomas, and Thomas Wilke, editors. Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001], volume 2500 of Lecture Notes in Computer Science. Springer, 2002. URL: https://doi.org/10.1007/3-540-36387-4.
  27. Erich Grädel and Michael Ummels. Solution Concepts and Algorithms for Infinite Multiplayer Games. In New Perspectives on Games and Interaction, volume 4, pages 151-178. Amsterdam University Press, 2008. URL: https://core.ac.uk/reader/36484420.
  28. Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Thomas Steeples, and Michael J. Wooldridge. Equilibria for games with combined qualitative and quantitative objectives. Acta Informatica, 58(6):585-610, 2021. URL: https://doi.org/10.1007/s00236-020-00385-4.
  29. Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, and Michael J. Wooldridge. Automated temporal equilibrium analysis: Verification and synthesis of multi-player games. Artificial Intelligence, 287:103353, 2020. URL: https://doi.org/10.1016/j.artint.2020.103353.
  30. Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, and Michael J. Wooldridge. On the complexity of rational verification. Ann. Math. Artif. Intell., 91(4):409-430, 2023. URL: https://doi.org/10.1007/s10472-022-09804-3.
  31. Bernard Ralph Hodgson. Décidabilité par automate fini. Annales des sciences mathématiques du Québec, 7:39-57, 1983. URL: https://www.labmath.uqam.ca/~annales/volumes/07-1/PDF/039-057.pdf.
  32. Orna Kupferman. Automata Theory and Model Checking. In Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem, editors, Handbook of Model Checking, pages 107-151. Springer, 2018. URL: https://doi.org/10.1007/978-3-319-10575-8_4.
  33. Orna Kupferman, Giuseppe Perelli, and Moshe Y. Vardi. Synthesis with rational environments. Annals of Mathematics and Artificial Intelligence, 78(1):3-20, 2016. URL: https://doi.org/10.1007/s10472-016-9508-8.
  34. Stéphane Le Roux and Arno Pauly. Equilibria in multi-player multi-outcome infinite sequential games. Information and Computation, 276:104557, 2021. 5th International Workshop on Strategic Reasoning (SR 2017). URL: https://doi.org/10.1016/j.ic.2020.104557.
  35. Christof Löding and Christopher Spinrath. Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. Discrete Mathematics & Theoretical Computer Science, 21(3), 2019. URL: https://doi.org/10.23638/dmtcs-21-3-4.
  36. John F. Nash. Equilibrium points in n-person games. Proceedings of the National Academy of Sciences of the United States of America, 36(1):48-49, 1950. URL: https://doi.org/10.1073/pnas.36.1.48.
  37. Martin J. Osborne. An introduction to game theory. Oxford Univ. Press, 2004. Google Scholar
  38. Martin J. Osborne and Ariel Rubinstein. A course in game theory. The MIT Press, Cambridge, USA, 1994. electronic edition. Google Scholar
  39. Sasha Rubin. Automatic structures. In Jean-Éric Pin, editor, Handbook of Automata Theory, pages 1031-1070. European Mathematical Society Publishing House, Zürich, Switzerland, 2021. URL: https://doi.org/10.4171/automata-2/6.
  40. Jacques Sakarovitch. Elements of Automata Theory. Cambridge University Press, 2009. URL: http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=9780521844253.
  41. Wolfgang Thomas. Automata on Infinite Objects. In Jan Van Leeuwen, editor, Formal Models and Semantics, Handbook of Theoretical Computer Science, pages 133-191. Elsevier, Amsterdam, 1990. URL: https://doi.org/10.1016/B978-0-444-88074-1.50009-3.
  42. Michael Ummels. The Complexity of Nash Equilibria in Infinite Multiplayer Games. In Roberto Amadio, editor, Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, volume 4962 of Lecture Notes in Computer Science, pages 20-34. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-78499-9_3.
  43. Michael Ummels and Dominik Wojtczak. The Complexity of Nash Equilibria in Limit-Average Games. In Joost-Pieter Katoen and Barbara König, editors, CONCUR 2011 - Concurrency Theory - 22nd International Conference, CONCUR 2011, Aachen, Germany, September 6-9, 2011. Proceedings, volume 6901 of Lecture Notes in Computer Science, pages 482-496. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-23217-6_32.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact