--- res: bibo_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.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Tomáš foaf_name: Brázdil, Tomáš foaf_surname: Brázdil - foaf_Person: foaf_givenName: Vojtěch foaf_name: Forejt, Vojtěch foaf_surname: Forejt - foaf_Person: foaf_givenName: Antonín foaf_name: Kučera, Antonín foaf_surname: Kučera - foaf_Person: foaf_givenName: Petr foaf_name: Novotny, Petr foaf_surname: Novotny foaf_workInfoHomepage: http://www.librecat.org/personId=3CC3B868-F248-11E8-B48F-1D18A9856A87 bibo_doi: 10.4230/LIPIcs.CONCUR.2016.10 bibo_volume: 59 dct_date: 2016^xs_gYear dct_language: eng dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@ dct_title: Stability in graphs and games@ ...