arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.03539cs.GTcs.FLcs.LO
收藏

延迟对策中的最优状态策略

Finite-state Strategies in Delay Games

Martin Zimmermann

摘要:

延迟博弈中的有限状态策略是什么?我们回答了这个令人惊讶的非平凡的问题,并提出了一个非常一般的框架计算这样的策略:它们存在的所有获胜的条件,自动机与接受条件,满足一定的聚合属性。我们的框架还产生上界的复杂性,确定这样的延迟游戏和上界的必要的前瞻赢得比赛的赢家。特别是,我们涵盖了所有以前的结果,这种特殊情况下,我们的统一方法。

英文摘要:

What is a finite-state strategy in a delay game? We answer this surprisingly non-trivial question and present a very general framework for computing such strategies: they exist for all winning conditions that are recognized by automata with acceptance conditions that satisfy a certain aggregation property. Our framework also yields upper bounds on the complexity of determining the winner of such delay games and upper bounds on the necessary lookahead to win the game. In particular, we cover all previous results of that kind as special cases of our uniform approach.

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

↑