Games on Graphs: From Logic and Automata to Algorithms
Computer Science and Game Theory
2025-07-30 v2 Formal Languages and Automata Theory
Logic in Computer Science
Abstract
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became important for program verification and synthesis. They have many more applications, in particular some of the models investigated in this book were introduced and studied in neighbouring research communities such as optimisation, reinforcement learning, model theory, and set theory.
Keywords
Cite
@article{arxiv.2305.10546,
title = {Games on Graphs: From Logic and Automata to Algorithms},
author = {Nathanaël Fijalkow and C. Aiswarya and Guy Avni and Nathalie Bertrand and Patricia Bouyer and Romain Brenguier and Arnaud Carayol and Antonio Casares and John Fearnley and Paul Gastin and Hugo Gimbert and Thomas A. Henzinger and Florian Horn and Rasmus Ibsen-Jensen and Nicolas Markey and Benjamin Monmege and Petr Novotný and Pierre Ohlmann and Mickael Randour and Ocan Sankur and Sylvain Schmitz and Olivier Serre and Mateusz Skomra and Nathalie Sznajder and Pierre Vandenhove},
journal= {arXiv preprint arXiv:2305.10546},
year = {2025}
}
Comments
621 pages. Coordinator: Nathana\"el Fijalkow