# Computer aided synthesis: a game theoretic approach

## TL;DR

This paper introduces game theory concepts and methods applied to computer aided synthesis, covering classical results on two-player and multi-player games, with connections to automata theory and solution approaches.

## Contribution

It provides a comprehensive overview of game theoretic approaches in synthesis, including classical results and solution strategies, with illustrative examples and proof intuitions.

## Key findings

- Classical results on two-player zero-sum games
- Extensions to multi-player non-zero-sum games
- Connections between one-player games and automata theory

## Abstract

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.