Sciweavers

CONCUR
2009
Springer

Measuring Permissivity in Finite Games

14 years 5 months ago
Measuring Permissivity in Finite Games
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for permissivity of such strategies by assigning penalties when blocking transitions. We prove that for reachability objectives, most permissive strategies exist, can be chosen memoryless, and can be computed in polynomial time, while it is in NP ∩ coNP for discounted and mean penalties.
Patricia Bouyer, Marie Duflot, Nicolas Markey, Gab
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where CONCUR
Authors Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault
Comments (0)