arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.08288cs.LOcs.DScs.FL
收藏

奇偶对策的对称吸引子分解提升算法

A symmetric attractor-decomposition lifting algorithm for parity games

Marcin Jurdziński, Rémi Morvan, Pierre Ohlmann, K. S. Thejaswini

摘要:

用于解决奇偶博弈的进度度量提升算法具有最佳的最坏情况渐近运行时间,但受到其不对称性质的限制,并且从Czerwienski等人的工作中得知。(2018)受到从通用树的组合学继承的匹配准多项式下界的影响。Parys(2019)开发了一种巧妙的准多项式McNaughton-Zielonka式算法,Lehtinen等人(2019)改进了其最坏情况下的运行时间。Jurdzirobski和Morvan(2020)最近提出了一种基于通用吸引子的算法,形式化了第二类求解奇偶博弈的准多项式解,这些解在通用树的大小上具有二次运行时间。首先,我们适应迭代提升算法的框架计算吸引子为基础的战略。其次,我们设计了一个对称的提升算法在这种情况下,其中两个提升迭代,一个为每个球员,以递归的方式相互加速。在最坏的情况下,对称算法的性能至少与进度测量提升一样好,同时绕过了它们固有的不对称限制。第三,我们认为Jurdzinski和Morvan(2020)的基于通用吸引子的算法的行为可以通过我们的对称提升算法的特定减速来再现,其中算法收集的一些信息被重复丢弃。这产生了一个新的解释,McNaughton-Zielonka式的算法作为进步措施提升迭代(故意设置回),进一步加强了所有已知的准多项式算法之间的联系。

英文摘要:

Progress-measure lifting algorithms for solving parity games have the best worst-case asymptotic runtime, but are limited by their asymmetric nature, and known from the work of Czerwiński et al. (2018) to be subject to a matching quasi-polynomial lower bound inherited from the combinatorics of universal trees. Parys (2019) has developed an ingenious quasi-polynomial McNaughton- Zielonka-style algorithm, and Lehtinen et al. (2019) have improved its worst-case runtime. Jurdziński and Morvan (2020) have recently brought forward a generic attractor-based algorithm, formalizing a second class of quasi-polynomial solutions to solving parity games, which have runtime quadratic in the size of universal trees. First, we adapt the framework of iterative lifting algorithms to computing attractor-based strategies. Second, we design a symmetric lifting algorithm in this setting, in which two lifting iterations, one for each player, accelerate each other in a recursive fashion. The symmetric algorithm performs at least as well as progress-measure liftings in the worst-case, whilst bypassing their inherent asymmetric limitation. Thirdly, we argue that the behaviour of the generic attractor-based algorithm of Jurdzinski and Morvan (2020) can be reproduced by a specific deceleration of our symmetric lifting algorithm, in which some of the information collected by the algorithm is repeatedly discarded. This yields a novel interpretation of McNaughton-Zielonka-style algorithms as progress-measure lifting iterations (with deliberate set-backs), further strengthening the ties between all known quasi-polynomial algorithms to date.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑