无限持续时间博弈的通用图理论
The Theory of Universal Graphs for Infinite Duration Games
AI总结：
本文提出通用图理论，用于构造求解奇偶博弈和平均收益博弈等无限持续时间博弈的算法，并给出四个应用，达到或改进已知最佳复杂度。
摘要：
我们引入通用图的概念，作为构造求解无限持续时间博弈（如奇偶博弈和平均收益博弈）算法的一种工具。在第一部分中，我们发展通用图理论，有两个目标：展示最近引入的相关模型之间的等价性和规范化结果，并为任何位置决定的博弈目标构造通用的值迭代算法。在第二部分中，我们给出四个应用：针对奇偶博弈、平均收益博弈、奇偶目标与平均收益目标的析取，以及多个平均收益目标的析取。对于这四种情况中的每一种，我们都构造了达到或改进已知最佳时间和空间复杂度的算法。
英文摘要：
We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff games. In the first part we develop the theory of universal graphs, with two goals: showing an equivalence and normalisation result between different recently introduced related models, and constructing generic value iteration algorithms for any positionally determined objective. In the second part we give four applications: to parity games, to mean payoff games, to a disjunction between a parity and a mean payoff objective, and to disjunctions of several mean payoff objectives. For each of these four cases we construct algorithms achieving or improving over the best known time and space complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
