Games on Graphs: From Logic and Automata to Algorithms
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909709524533248 |
|---|---|
| author | Fijalkow, Nathanaël Aiswarya, C. Avni, Guy Bertrand, Nathalie Bouyer, Patricia Brenguier, Romain Carayol, Arnaud Casares, Antonio Fearnley, John Gastin, Paul Gimbert, Hugo Henzinger, Thomas A. Horn, Florian Ibsen-Jensen, Rasmus Markey, Nicolas Monmege, Benjamin Novotný, Petr Ohlmann, Pierre Randour, Mickael Sankur, Ocan Schmitz, Sylvain Serre, Olivier Skomra, Mateusz Sznajder, Nathalie Vandenhove, Pierre |
| author_facet | Fijalkow, Nathanaël Aiswarya, C. Avni, Guy Bertrand, Nathalie Bouyer, Patricia Brenguier, Romain Carayol, Arnaud Casares, Antonio Fearnley, John Gastin, Paul Gimbert, Hugo Henzinger, Thomas A. Horn, Florian Ibsen-Jensen, Rasmus Markey, Nicolas Monmege, Benjamin Novotný, Petr Ohlmann, Pierre Randour, Mickael Sankur, Ocan Schmitz, Sylvain Serre, Olivier Skomra, Mateusz Sznajder, Nathalie Vandenhove, Pierre |
| contents | The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became important for program verification and synthesis. They have many more applications, in particular some of the models investigated in this book were introduced and studied in neighbouring research communities such as optimisation, reinforcement learning, model theory, and set theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_10546 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Games on Graphs: From Logic and Automata to Algorithms Fijalkow, Nathanaël Aiswarya, C. Avni, Guy Bertrand, Nathalie Bouyer, Patricia Brenguier, Romain Carayol, Arnaud Casares, Antonio Fearnley, John Gastin, Paul Gimbert, Hugo Henzinger, Thomas A. Horn, Florian Ibsen-Jensen, Rasmus Markey, Nicolas Monmege, Benjamin Novotný, Petr Ohlmann, Pierre Randour, Mickael Sankur, Ocan Schmitz, Sylvain Serre, Olivier Skomra, Mateusz Sznajder, Nathalie Vandenhove, Pierre Computer Science and Game Theory Formal Languages and Automata Theory Logic in Computer Science The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared in the study of automata and logic, and they later became important for program verification and synthesis. They have many more applications, in particular some of the models investigated in this book were introduced and studied in neighbouring research communities such as optimisation, reinforcement learning, model theory, and set theory. |
| title | Games on Graphs: From Logic and Automata to Algorithms |
| topic | Computer Science and Game Theory Formal Languages and Automata Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2305.10546 |