Games on Graphs
From Logic and Automata to Algorithms
- Publisher's listprice GBP 125.00
-
59 718 Ft (56 875 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 10% (cc. 5 972 Ft off)
- Discounted price 53 747 Ft (51 188 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
59 718 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 30 April 2026
- ISBN 9781009500685
- Binding Hardback
- No. of pages600 pages
- Language English 700
Categories
Short description:
Tutorial surveys by a multidisciplinary team of experts on research on infinite duration games on graphs and their applications.
MoreLong description:
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.
'Games on Graphs: From Logic and Automata to Algorithms, coordinated by Nathana&&&235;l Fijalkow, is a must-read book that I highly recommend. Written with rigor and clarity, it presents the state of the art on games on graphs and their algorithms, a selection of exciting open problems and a wealth of new research directions. A book destined to become the essential reference work in its field!' Jean-&&&201;ric Pin, Paris
Table of Contents:
List of contributors; Preface; 1. Introduction Nathana&&&235;l Fijalkow; I. Classic: 2. Parity games John Fearnley and Nathana&&&235;l Fijalkow; 3. Regular games Nathanael Fijalkow and Florian Horn; 4. Positionality and memory Antonio Casares, Pierre Ohlmann and Pierre Vandenhov; 5. Games with payoffs Nathana&&&235;l Fijalkow and Benjamin Monmege; II. Stochastic: 6. Markov decision processes Petr Novotn&&&253;; 7. Stochastic games Nathalie Betrand, Patricia Bouyer and Nathana&&&235;l Fijalkow; III. Information: 8. Concurrent games Rasmus Ibsen-Jensen; 9. Games with signals Hugo Gimbert; 10. Synchronous distributed games C. Aiswarya, Paul Gastin and Nathalie Sznajder; IV. Infinite: 11. Timed games Nicolas Markey and Ocan Sankur; 12. Pushdown games Arnaud Carayol and Olivier Serre; 13. Games with counters Sylvain Schmitz; V. Multi: 14. Games with multiple objectives Mickael Randour; 15. Multiplayer games Romain Brenguier and Ocan Sankue; 16. Bidding games Guy Avni and Thomas A. Henzinger; Bibliography.
More
