arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1606.01975math.CO
收藏

绝对组合对策论

Absolute Combinatorial Game Theory

Urban Larsson, Richard J. Nowakowski, Carlos P. Santos

摘要:

我们为组合对策论中的标准约定提出了一个统一的可加性理论,包括Berlekamp、Conway、Dorbec、Ettinger、Guy、Larsson、Milley、Neto、Nowakowski、Renault、Santos、Siegel、Spena、Stewart(1976-2019)等研究的正常、吝啬和得分博弈。博弈{ \em universe}是满足某些标准封闭性的博弈集合。在这里,我们揭示了当基本的游戏比较问题,``是$G\su H$?“,简化为一个建设性的”本地“的解决方案,这推广了康威的基本结果在ONAG(1976)的正常发挥游戏。只要给定的游戏宇宙是{ \em绝对},这就以广泛和一般的方式发生。在绝对宇宙中的游戏满足两个属性,称为{ \em parentality}和{ \em saturation},我们证明了后者是由前者所隐含的。亲合性意味着任何一对非空的有限博弈集都可以作为选项,饱和性意味着,给定任何博弈,第一个博弈者可以在析取和中得到青睐。博弈比较是组合对策论的核心,例如,势归约定理的效率依赖于局部比较。我们区分三个层次的游戏比较;上级(全球),基本(半建设性)和下级(本地)的比较。在证明中,CGT的研究人员有时会面临一个乏味的挑战:为了证明不等式是错误的,可能需要一个显式的区分博弈。在这里,我们解释了当宇宙是绝对的时候,这个工作是如何变得过时的。也就是说,只要看看一对博弈是否满足一定的但书以及不等式的维持就足够了。

英文摘要:

We propose a unifying additive theory for standard conventions in Combinatorial Game Theory, including normal-, misère- and scoring-play, studied by Berlekamp, Conway, Dorbec, Ettinger, Guy, Larsson, Milley, Neto, Nowakowski, Renault, Santos, Siegel, Sopena, Stewart (1976-2019), and others. A game {\em universe} is a set of games that satisfies some standard closure properties. Here, we reveal when the fundamental game comparison problem, ``Is $G\su H$?'', simplifies to a constructive `local' solution, which generalizes Conway's foundational result in ONAG (1976) for normal-play games. This happens in a broad and general fashion whenever a given game universe is {\em absolute}. Games in an absolute universe satisfy two properties, dubbed {\em parentality} and {\em saturation}, and we prove that the latter is implied by the former. Parentality means that any pair of non-empty finite sets of games is admissible as options, and saturation means that, given any game, the first player can be favored in a disjunctive sum. Game comparison is at the core of combinatorial game theory, and for example efficiency of potential reduction theorems rely on a local comparison. We distinguish between three levels of game comparison; superordinate (global), basic (semi-constructive) and subordinate (local) comparison. In proofs, a sometimes tedious challenge faces a researcher in CGT: in order to disprove an inequality, an explicit distinguishing game might be required. Here, we explain how this job becomes obsolete whenever a universe is absolute. Namely, it suffices to see if a pair of games satisfies a certain Proviso together with a Maintenance of an inequality.

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

↑