In this invited contribution, we propose a comprehensive introduction to game theory applied in computer aided synthesis. In this context, we give some classical results on two-player zero-sum games and then on multi-player non zero-sum games. The simple case of one-player games is strongly related to automata theory on infinite words. All along the article, we focus on general approaches to solve the studied problems, and we provide several illustrative examples as well as intuitions on the proofs.
CITATION STYLE
Bruyère, V. (2017). Computer aided synthesis: A game-theoretic approach. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 10396 LNCS, 3–35. https://doi.org/10.1007/978-3-319-62809-7_1
Mendeley helps you to discover research relevant for your work.