Admissibility in quantitative graph games

Admissibility has been studied for games of infinite duration with Boolean objectives. In this talk, we recall the computation of admissible strategies for these games, and explain the application for multiplayer controller synthesis. We then extend this study to games of infinite duration with quantitative objectives. We show that, under the assumption that optimal worst-case and cooperative strategies exist, admissible strategies are guaranteed to exist. Second, we give a characterization of admissible strategies using the notion of adversarial and cooperative values of a history, and we characterize the set of outcomes that are compatible with admissible strategies. Finally, we show how these characterizations can be used to design algorithms to decide relevant quantitative verification and synthesis problems.

Authors

• Ocan Sankur

Keywords

No keywords are indexed for this paper.