Game Refinement Relations and Metrics
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, Mari\"elle Stoelinga

TL;DR
This paper introduces new equivalences and metrics for two-player probabilistic games on finite states, characterizing probabilistic winning conditions and extending classical bisimulation concepts to game structures.
Contribution
It develops novel equivalences and metrics for two-player games that capture probabilistic winning probabilities and generalize bisimulation to game settings.
Findings
Characterizes differences in winning probabilities using new metrics.
Provides a framework for probabilistic equivalences in game structures.
Extends classical bisimulation to two-player game models.
Abstract
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves. Given a goal, for example, reach a target state, the question of winning is thus a probabilistic one: what is the maximal probability of winning from a given state? On these game structures, two fundamental notions are those of equivalences and metrics. Given a set of winning conditions, two states are equivalent if the players can win the same games with the same probability from both states. Metrics provide a bound on the difference in the probabilities of winning across states, capturing a quantitative notion of state similarity. We introduce equivalences and metrics for two-player…
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.
