3 citations · 5 across the 8 of their papers we have counts for
3 papers · 1 filter
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…
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…
Mean-payoff Games with Partial Observation
Paul Hunter, Arno Pauly, Guillermo A. Pérez +1
Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorith…