Stability in Graphs and Games
Logic in Computer Science
2016-04-22 v1
Abstract
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
Keywords
Cite
@article{arxiv.1604.06386,
title = {Stability in Graphs and Games},
author = {Tomáš Brázdil and Vojtěch Forejt and Antonín Kučera and Petr Novotný},
journal= {arXiv preprint arXiv:1604.06386},
year = {2016}
}