Conference item icon

Conference item

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.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.4230/LIPIcs.CONCUR.2016.10

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Grant:
FP7/2007-2013) People Programme (Marie Curie Actions) no. 291734
Publisher:
Schloss Dagstuhl Publisher's website
Journal:
CONCUR 2016 Journal website
Volume:
59
Pages:
10:1--10:14
Series:
Leibniz International Proceedings in Informatics
Host title:
27th International Conference on Concurrency Theory (CONCUR 2016)
Publication date:
2016-08-01
Acceptance date:
2016-06-08
DOI:
ISSN:
1868-8969
Source identifiers:
632186
ISBN:
9783959770170
Keywords:
Pubs id:
pubs:632186
UUID:
uuid:cf8ca0fc-9243-489c-9dfd-eddb0789bfd2
Local pid:
pubs:632186
Deposit date:
2016-07-05

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP