Stability in graphs and games

Brázdil, Tomáš and Forejt, Vojtěch and Kučera, Antonín and Novotný, Petr (2016) Stability in graphs and games. In: CONCUR: Concurrency Theory, August 23-26, 2016, Québec City, Canada.

[img] Text
Forejt_et_al__Stability_in_graphs_and_games.pdf - Published Version
Available under License Creative Commons Attribution.
[IST-2016-665-v1+1]
Download (540Kb)
Official URL: https://dx.doi.org/10.4230/LIPIcs.CONCUR.2016.10

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.

Item Type: Conference or Workshop Item (Paper)
Subjects: 000 Computer science, knowledge & general works > 000 Computer science, knowledge & systems > 004 Data processing & computer science
Research Group: Chatterjee Group
SWORD Depositor: Sword Import User
Depositing User: Sword Import User
Date Deposited: 10 Nov 2016 08:26
Last Modified: 30 Aug 2017 14:31
URI: https://repository.ist.ac.at/id/eprint/665

Actions (login required)

View Item View Item