arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.5274cs.DMcs.CCmath.CO
收藏

决定对策不变性

Deciding game invariance

Eric Duchêne, Aline Parreau, Michel Rigo

摘要:

Duchêne和Rigo为堆上的外卖博弈引入了不变性的概念。粗略地说,这些游戏的规则集不依赖于位置。给定一个正整数元组序列$S$,是否存在一个以$S$为$\mathcal{P}$ -位置集合的不变博弈的问题是相关的。特别地,最近Larsson等人证明了,如果$S$是一对互补的Beatty序列,则该问题的答案总是肯定的。在本文中,我们表明,对于一个相当大的序列集(由无限的话表示),这个问题的答案是可判定的。

英文摘要:

Duchêne and Rigo introduced the notion of invariance for take-away games on heaps. Roughly speaking, these are games whose rulesets do not depend on the position. Given a sequence $S$ of positive tuples of integers, the question of whether there exists an invariant game having $S$ as set of $\mathcal{P}$-positions is relevant. In particular, it was recently proved by Larsson et al. that if $S$ is a pair of complementary Beatty sequences, then the answer to this question is always positive. In this paper, we show that for a fairly large set of sequences (expressed by infinite words), the answer to this question is decidable.

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

↑