License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2016.10
URN: urn:nbn:de:0030-drops-61784
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6178/
Brazdil, Tomas ;
Forejt, Vojtech ;
Kucera, Antonin ;
Novotny, Petr
Stability in Graphs and Games
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.
BibTeX - Entry
@InProceedings{brazdil_et_al:LIPIcs:2016:6178,
author = {Tomas Brazdil and Vojtech Forejt and Antonin Kucera and Petr Novotny},
title = {{Stability in Graphs and Games}},
booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-017-0},
ISSN = {1868-8969},
year = {2016},
volume = {59},
editor = {Jos{\'e}e Desharnais and Radha Jagadeesan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6178},
URN = {urn:nbn:de:0030-drops-61784},
doi = {10.4230/LIPIcs.CONCUR.2016.10},
annote = {Keywords: Games, Stability, Mean-Payoff, Window Objectives}
}
|
Keywords: |
|
Games, Stability, Mean-Payoff, Window Objectives |
|
Collection: |
|
27th International Conference on Concurrency Theory (CONCUR 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
24.08.2016 |
