A Game-Theoretic Approach for the Synthesis of Complex Systems

In this brief overview, we consider multi-player turn-based infinite-duration games that are played on a finite directed graph and such that each player aims at maximizing a payoff or minimizing a cost. We discuss several solution concepts and present some classical as well as some more recent resul...

Full description

Saved in:
Bibliographic Details
Published inRevolutions and Revelations in Computability Vol. 13359; pp. 52 - 63
Main Author Bruyère, Véronique
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2022
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Computer-aided synthesis
Games played on graphs
Solution concepts
Online AccessGet full text
ISBN3031087399
9783031087394
ISSN0302-9743
1611-3349
DOI10.1007/978-3-031-08740-0_5

Cover

More Information
Summary:In this brief overview, we consider multi-player turn-based infinite-duration games that are played on a finite directed graph and such that each player aims at maximizing a payoff or minimizing a cost. We discuss several solution concepts and present some classical as well as some more recent results, with a focus on reachability objectives for the players.
Bibliography:Partially supported by the PDR project Subgame perfection in graph games (F.R.S.-FNRS).
ISBN:3031087399
9783031087394
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-031-08740-0_5