Stability in Graphs and Games
Autoři | |
---|---|
Rok publikování | 2016 |
Druh | Článek ve sborníku |
Konference | 27th International Conference on Concurrency Theory, CONCUR 2016 |
Fakulta / Pracoviště MU | |
Citace | |
Doi | http://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.10 |
Obor | Informatika |
Klíčová slova | turn-based games; mean payoff; stability |
Popis | 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. |
Související projekty: |