Games on Graphs: From Logic and Automata to Algorithms

‪Nathanaël Fijalkow (Curatore)

Cambridge University Press, 2026

This volume introduces the fundamental results and the state of the art in infinite duration games on graphs. These versatile game models first appeared in the study of automata and logic, but later became important for program verification and synthesis. They have many more applications. In particular, this book covers models from the fields of optimisation, reinforcement learning, model theory, and set theory. The material is presented at a level accessible to beginning graduate students, requiring only a basic understanding of discrete algorithms and graphs. The book's primary objective is constructing efficient algorithms for analysing different types of games. Rather than describe their implementation in full detail, it investigates their theoretical foundations and proves their properties and winning strategies. This tutorial reference from experts across the field is ideal for students, researchers, and professionals in logic and automata, verification and synthesis, and related fields.

• Curatore: ‪Nathanaël Fijalkow
• Editore: Cambridge University Press
• Anno: 2026
• Rilegatura: Hardback
• Pagine: 604 p.
• Peso: 1155 gr.
• EAN: 9781009500685

Testo in English