DMCA
Measuring Permissivity in Finite Games (2009)
Cached
Download Links
by
Patricia Bouyer
,
Marie Duflot
,
Nicolas Markey
,
Gabriel Renault
| Citations: | 5 - 4 self |
BibTeX
@MISC{Bouyer09measuringpermissivity,
author = {Patricia Bouyer and Marie Duflot and Nicolas Markey and Gabriel Renault},
title = {Measuring Permissivity in Finite Games},
year = {2009}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
