Answers are grounded in this paper and cite their sources.
In this survey, we propose a comprehensive introduction to game theory applied to computer-aided synthesis. We study multi-player turn-based infinite-duration games played on a finite directed graph such that each player aims at maximizing a payoff function. We present the well-known notions of Nash equilibrium and subgame perfect equilibrium, as well as interesting strategy profiles of players as response to the strategy announced by a specific player. We provide classical and recent results about the related threshold synthesis problem.
No takes yet. Share an insight, caveat, or question.
Véronique Bruyère (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: