Stability in Graphs and Games
Tom\'a\v{s} Br\'azdil, Vojt\v{e}ch Forejt, Anton\'in Ku\v{c}era and, Petr Novotn\'y
TL;DR
This paper introduces new definitions and algorithms to analyze the stability of systems modeled as graphs and two-player games with mean payoff objectives, addressing fluctuations not captured by traditional mean-payoff measures.
Contribution
It proposes novel stability concepts and algorithms for verifying stability in systems with mean payoff properties, extending beyond existing mean-payoff analysis.
Findings
Algorithms for deciding stability and mean payoff objectives
New definitions capturing system fluctuations
Applicability to graphs and two-player 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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Petri Nets in System Modeling · Logic, programming, and type systems