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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Bouyer, P., Duflot, M., Markey, N., & Renault, G. (2009). Measuring Permissivity in Finite Games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5710 LNCS, pp. 196–210). https://doi.org/10.1007/978-3-642-04081-8_14
Mendeley helps you to discover research relevant for your work.