高度非重复序列:从局部引理中获胜的策略
Highly nonrepetitive sequences: winning strategies from the local lemma
摘要:
我们证明了非重复序列的几个经典结果的博弈论版本,使用扩展的Lovász局部引理,可以显着减少依赖图中所需的边的数量时,有一个潜在的事件的显着的依赖顺序的存在获胜的策略。这似乎代表了第一次成功的应用程序的本地引理的游戏。
英文摘要:
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Lovász Local Lemma which can dramatically reduce the number of edges needed in a dependency graph when there is an ordering underlying the significant dependencies of events. This appears to represent the first successful application of a Local Lemma to games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。