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

多人多联盟Zeckendorf博弈的获胜策略

Winning Strategy for the Multiplayer and Multialliance Zeckendorf Games

Anna Cusenza, Aidan Dunkelberg, Kate Huffman, Dianhui Ke, Daniel Kleber, Steven J. Miller, Clayton Mizgerd, Vashisth Tiwari, Jingkai Ye, Xiaoyan Zheng

摘要:

Edouard Zeckendorf证明了每一个正整数$n$都可以被唯一地写成\cite{Ze}作为不相邻的斐波那契数之和,称为Zeckendorf分解。基于Zeckendorf的分解,我们有多个参与人的Zeckendorf博弈。我们表明,当Zeckendorf游戏至少有$3$的球员,没有球员有一个获胜的策略$n\geq 5$。然后,我们将多人博弈扩展到多联盟博弈,发现了一些有趣的情况,其中没有联盟有一个获胜的策略。这包括两个联盟的博弈,以及其中一个联盟总是有获胜策略的一些情况。我们研究什么联盟,或球员的组合,可以赢得,以及他们必须要做到这一点的规模。我们还发现了必要的结构性限制,即我们的证明方法可以证明哪些联盟是赢家。此外,我们发现一些联盟结构,必须有获胜的战略。我们还将广义Zeckendorf对策从$2$ -局中人推广到多局中人.我们发现,当游戏中有$3$参与者时,参与者$2$永远不会对任何显著大的$n$有获胜策略。我们还发现,当游戏至少有$4$玩家时,没有玩家对任何显著大的$n$有获胜策略。

英文摘要:

Edouard Zeckendorf proved that every positive integer $n$ can be uniquely written \cite{Ze} as the sum of non-adjacent Fibonacci numbers, known as the Zeckendorf decomposition. Based on Zeckendorf's decomposition, we have the Zeckendorf game for multiple players. We show that when the Zeckendorf game has at least $3$ players, none of the players have a winning strategy for $n\geq 5$. Then we extend the multi-player game to the multi-alliance game, finding some interesting situations in which no alliance has a winning strategy. This includes the two-alliance game, and some cases in which one alliance always has a winning strategy. %We examine what alliances, or combinations of players, can win, and what size they have to be in order to do so. We also find necessary structural constraints on what alliances our method of proof can show to be winning. Furthermore, we find some alliance structures which must have winning strategies. %We also extend the Generalized Zeckendorf game from $2$-players to multiple players. We find that when the game has $3$ players, player $2$ never has a winning strategy for any significantly large $n$. We also find that when the game has at least $4$ players, no player has a winning strategy for any significantly large $n$.

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

↑