求解奇方公平奇偶博弈
Solving Odd-Fair Parity Games
AI总结:
本文研究Odd-fair parity games的高效求解,提出一种具有与Zielonka算法相同最坏时间复杂度的Zielonka型算法,并首次形式化了Odd玩家的获胜策略。
摘要:
本文讨论了高效求解奇偶博弈的问题,其中玩家 Odd 必须在其顶点上遵守额外的“强转移公平约束”——给定玩家 Odd 的顶点 $v$ 被无限次访问,$v$ 的一个特定出边子集(称为活跃边)也必须被无限次选取。这种我们称之为“Odd-fair parity games”的博弈,自然地产生于用于规划和控制的网络物理系统的抽象中。在本文中,我们提出了一种新的 Zielonka 型算法来求解 Odd-fair parity games。该算法不仅与 Zielonka 算法求解(普通)奇偶博弈具有“相同的最坏情况时间复杂度”,而且保留了 Zielonka 算法相对于其他具有指数时间复杂度的奇偶博弈求解器的算法优势。我们还额外引入了此类博弈中 Odd 玩家获胜策略的形式化,这在先前的工作中尚未被探索。该形式化具有双重目的:首先,它使我们能够证明我们的 Zielonka 型算法;其次,它本身也是一项值得注意的贡献,增进了我们对双人博弈中附加公平性假设的理解。
英文摘要:
This paper discusses the problem of efficiently solving parity games where player Odd has to obey an additional 'strong transition fairness constraint' on its vertices -- given that a player Odd vertex $v$ is visited infinitely often, a particular subset of the outgoing edges (called live edges) of $v$ has to be taken infinitely often. Such games, which we call 'Odd-fair parity games', naturally arise from abstractions of cyber-physical systems for planning and control. In this paper, we present a new Zielonka-type algorithm for solving Odd-fair parity games. This algorithm not only shares 'the same worst-case time complexity' as Zielonka's algorithm for (normal) parity games but also preserves the algorithmic advantage Zielonka's algorithm possesses over other parity solvers with exponential time complexity. We additionally introduce a formalization of Odd player winning strategies in such games, which were unexplored previous to this work. This formalization serves dual purposes: firstly, it enables us to prove our Zielonka-type algorithm; secondly, it stands as a noteworthy contribution in its own right, augmenting our understanding of additional fairness assumptions in two-player games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。