arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2309.17022cs.LO
收藏

$Σ_0^2$中的位置性及一个完备性结果

Positionality in $Σ_0^2$ and a completeness result

CNRS, Aix-Marseille Université(法国国家科学研究中心,艾克斯马赛大学);Laboratoire d’Informatique et des Systèmes (LIS)(信息与系统实验室);Institute of Informatics, University of Warsaw(华沙大学信息学研究所)

Pierre Ohlmann, Michał Skrzypczak

AI总结:

本文研究了无限持续游戏中主角的位置策略存在性,证明了$Σ_0^2$中前缀无关的目标在满足强中性字母条件时,恰好能被可数序数上的历史确定单调co-Bchi自动机识别,并给出了该类目标在有限游戏图上闭合性的新证明。

摘要:

本文研究了无限持续游戏中主角的位置策略存在性,证明了$Σ_0^2$中前缀无关的目标在满足强中性字母条件时,恰好能被可数序数上的历史确定单调co-Bchi自动机识别,并给出了该类目标在有限游戏图上闭合性的新证明。随后,本文给出了两个应用。首先,证明了均值支付目标在任意游戏图上是位置性的。其次,建立了以下完备性结果:对于任何前缀无关、满足强中性字母条件且在有限游戏图上位置性的目标$W$,存在一个与$W$在有限游戏图上等价且在任意游戏图上位置性的目标$W'$。

英文摘要:

We study the existence of positional strategies for the protagonist in infinite duration games over arbitrary game graphs. We prove that prefix-independent objectives in $Σ_0^2$ which are positional and admit a (strongly) neutral letter are exactly those that are recognised by history-deterministic monotone co-Bchi automata over countable ordinals. This generalises a criterion proposed by [Kopczyński, ICALP 2006] and gives an alternative proof of closure under union for these objectives, which was known from [Ohlmann, TheoretiCS 2023]. We then give two applications of our result. First, we prove that the mean-payoff objective is positional over arbitrary game graphs. Second, we establish the following completeness result: for any objective $W$ which is prefix-independent, admits a (weakly) neutral letter, and is positional over finite game graphs, there is an objective $W'$ which is equivalent to $W$ over finite game graphs and positional over arbitrary game graphs.

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

↑