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.

• Type: Conference
• Year: 2009
• Where: CONCUR
• Authors: Patricia Bouyer, Marie Duflot, Nicolas Markey, Gabriel Renault
• Keywords: Classical Notion, CONCUR 2009, Distributed And Parallel Computing, Strategies, Turn-based finite Games