34 citations · 174 across the 26 of their papers we have counts for
3 papers · 2 filters
Minimizing Regret in Discounted-Sum Games
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
In this paper, we study the problem of minimizing regret in discounted-sum games played on weighted game graphs. We give algorithms for the general problem of computing the minimal…
Quantitative Games under Failures
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +3
We study a generalisation of sabotage games, a model of dynamic network games introduced by van Benthem. The original definition of the game is inherently finite and therefore does…
Reactive Synthesis Without Regret
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
Two-player zero-sum games of infinite duration and their quantitative versions are used in verification to model the interaction between a controller (Eve) and its environment (Ada…