度量奇偶博弈中的宽容度：再论平均收益奇偶博弈
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
摘要：
我们研究奇偶博弈中的不确定性策略，目的是计算一个最宽容的获胜策略。在早期的工作之后，我们根据策略阻止的转换的平均数量/权重来衡量宽容度。使用翻译成平均支付平价游戏，我们证明了问题的计算（的许可）一个最宽容的获胜策略是在NP-NP。在此过程中，我们提供了一个新的研究平均收益平价游戏。特别地，我们证明了对手有一个无记忆的最优策略，并给出了一个新的算法来解决这些游戏。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
