Stability in Graphs and Games

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš FOREJT Vojtěch KUČERA Antonín NOVOTNÝ Petr

Year of publication 2016
Type Article in Proceedings
Conference 27th International Conference on Concurrency Theory, CONCUR 2016
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.10
Field Informatics
Keywords turn-based games; mean payoff; stability
Description We study graphs and two-player games in which rewards are assigned to states, and the goal of the players is to satisfy or dissatisfy certain property of the generated outcome, given as a mean payoff property. Since the notion of mean-payoff does not reflect possible fluctuations from the mean-payoff along a run, we propose definitions and algorithms for capturing the stability of the system, and give algorithms for deciding if a given mean payoff and stability objective can be ensured in the system.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.