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

随机玩家博弈与错排数

A Random-Player Game and Derangement Numbers

Yehonatan Fridman

AI总结:

研究随机玩家R与确定性玩家D的博弈,证明D获胜概率Dn随n增大趋于1/e,且等于第n个错排数除以n!。

摘要:

考虑随机玩家R与确定性玩家D之间的博弈。初始有n个元素的堆。R的回合中,若堆有m个元素,R移除k个,k独立同分布于{1,...,m}。D的回合仅移除一个元素。在其回合结束时无剩余元素的玩家获胜。R先手。本文证明Dn(初始n元素时D获胜概率)随n增大趋于1/e;具体地,Dn=dn/n!,其中dn为第n个错排数。

英文摘要:

Consider the following game between a random player R and a deterministic player D. There is a pile of n elements at the beginning. The rules for playing are as follows: In each turn of R, if the pile contains exactly m elements, R removes k elements from the pile, where k is independently identically distributed from {1, . . . , m}. In each turn of D, D removes only one element. The winner is the player that, at the end of its round, has no elements remaining. R starts first to play. This short paper shows that Dn, which is defined as the probability of D winning the game (when is initialized with n elements), approaches 1/e when n increases; and more specifically, Dn = dn/n!, where dn is the n-th derangement number.

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

↑