Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
Logic in Computer Science
2013-01-14 v2 Computer Science and Game Theory
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 the strategy. Using a translation into mean-payoff parity games, we prove that the problem of computing (the permissiveness of) a most permissive winning strategy is in NP intersected coNP. Along the way, we provide a new study of mean-payoff parity games. In particular, we prove that the opponent player has a memoryless optimal strategy and give a new algorithm for solving these games.
Keywords
Cite
@article{arxiv.1102.3615,
title = {Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited},
author = {Patricia Bouyer and Nicolas Markey and Jörg Olschewski and Michael Ummels},
journal= {arXiv preprint arXiv:1102.3615},
year = {2013}
}
Comments
30 pages, revised version