pith. sign in

arxiv: 1604.06386 · v1 · pith:ZFDDIZM4new · submitted 2016-04-21 · 💻 cs.LO

Stability in Graphs and Games

classification 💻 cs.LO
keywords stabilityalgorithmsgamesgivengraphsmeanmean-payoffpayoff
0
0 comments X
read the original 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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.