Games on Graphs by Nathanaël Fijalkow (.PDF)
File Size: 10 MB
Games on Graphs: From Logic and Automata to Algorithms by Nathanaël Fijalkow
Requirements: .PDF reader, 10 MB
Overview: 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. The primary objective in this book is algorithmic: constructing efficient algorithms for analysing different types of games. Yet the goal is not to describe their implementation in full detail but rather to explain their theoretical foundations. In this endeavour we often need to set the stage by proving properties of the corresponding games and, most prominently, the properties of their winning strategies. So the language of this book is mathematics. 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.
Genre: Non-Fiction > Tech & Devices
Free Download links: