Omega正则对策中可容许性的复杂性
The Complexity of Admissibility in Omega-Regular Games
摘要：
迭代容许性是经典博弈论中一个著名的重要概念，例如在多人矩阵博弈中确定理性行为。正如Berwanger最近所展示的，这个概念可以很好地扩展到具有Ω正则目标的图上的无限游戏。在本文中，我们研究了这类游戏的概念的算法特性。我们解决的确切复杂性的自然决策问题的一组策略，生存迭代淘汰的劣势战略。作为我们构建的副产品，我们获得了自动机，它可以识别这些策略的所有可能结果。
英文摘要：
Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games played on graphs with omega-regular objectives. In this paper, we study the algorithmic properties of this concept for such games. We settle the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies. As a byproduct of our construction, we obtain automata which recognize all the possible outcomes of such strategies.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
