基于分离自动机的目标组合新算法
New Algorithms for Combinations of Objectives using Separating Automata
摘要：
分离自动机的概念是由Bojanczyk和Czerwinski为了理解奇偶博弈的第一个拟多项式时间算法而引入的。在本文中，我们表明，分离自动机是一个强大的工具，构建算法解决游戏的目标组合。我们构建两个新的算法：第一个为分离的奇偶性和平均收益目标，匹配的最佳已知的复杂性，和第二个为分离的平均收益目标，提高了最先进的。在这两种情况下，通过小分离自动机的建设，作为黑盒子使用现有的结构奇偶性目标和平均收益目标的算法。
英文摘要：
The notion of separating automata was introduced by Bojanczyk and Czerwinski for understanding the first quasipolynomial time algorithm for parity games. In this paper we show that separating automata is a powerful tool for constructing algorithms solving games with combinations of objectives. We construct two new algorithms: the first for disjunctions of parity and mean payoff objectives, matching the best known complexity, and the second for disjunctions of mean payoff objectives, improving on the state of the art. In both cases the algorithms are obtained through the construction of small separating automata, using as black boxes the existing constructions for parity objectives and for mean payoff objectives.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
