دانلود کتاب بازی‌ها روی گراف‌ها، از منطق و اتوماتا تا الگوریتم‌ها

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 text from experts across the field is ideal for students, for researchers, and for professionals in logic and automata, verification and synthesis, and related fields. nathanaël fijalkow is Director of Research at CNRS, LaBRI, University of Bordeaux. He has been working on games on graphs for over a decade and has contributed to some of the field’s most important recent results. He has taught games on graphs at several universities (Paris, Warsaw, Bordeaux) and has been heavily involved in organising scientific events on the topic.