The authors, including Nathanaël Fijalkow and Hugo Gimbert, published the book “Games on Graphs” with Cambridge University Press last May.
The book covers fundamental results and the state of the art in the field of infinite-duration games on graphs.
The content is accessible to beginning graduate students, requiring only a basic understanding of discrete algorithms and graphs.
These versatile game models, originally studied in the fields of automata theory and logic, are now essential for program verification and synthesis, and have numerous applications. This book is a leading reference in the field, covering optimization models, reinforcement learning, and model and set theories. Its goal is to create efficient algorithms for analyzing different types of games by leveraging theoretical foundations and winning strategies, rather than their implementations.