Abstract
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by a strategy. Using a translation into mean-payoff parity games, we prove that deciding (the permissiveness of) a most permissive winning strategy is in NP ∩ coNP. Along the way, we provide a new study of mean-payoff parity games. In particular, we give a new algorithm for solving these games, which beats all previously known algorithms for this problem. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Bouyer, P., Markey, N., Olschewski, J., & Ummels, M. (2011). Measuring permissiveness in parity games: Mean-payoff parity games revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6996 LNCS, pp. 135–149). Springer Verlag. https://doi.org/10.1007/978-3-642-24372-1_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
