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

关于每轮至少需搁置一枚硬币时最大化正面朝上数量的研究

On maximizing the number of heads when you need to set aside at least one coin every round

Wouter van Doorn

AI总结:

本文研究每轮至少搁置一枚硬币时最大化正面朝上总数的博弈问题,证明了不同$p$值下的最优搁置策略,推导了最优期望正面数的不等式性质及相关序列的收敛性。

摘要:

考虑如下博弈:初始有$n$枚硬币,每枚正面朝上的概率均为$p$。你抛掷所有硬币,随后必须搁置至少一枚,该硬币不再参与后续抛掷。接着用剩余硬币重复上述过程,该过程最多持续$n$轮,直至所有硬币均被搁置。你的目标是最大化最终获得的正面朝上总数量。本文证明存在常数$p_0 \approx 0.5495021777642$,当$p_0 < p \le 1$且剩余硬币数量足够大时,除非所有硬币均正面朝上,否则每轮恰好搁置一枚硬币是最优策略。当$\frac{1}{2} \le p \le p_0$时,除非至多有一枚硬币反面朝上,否则每轮恰好搁置一枚硬币是最优策略。设$v_{n,p}$为采用最优策略时获得的正面朝上数量的期望。本文证明对所有$n \ge 3$且所有$p \ge \frac{1}{2}$,均有$v_{n,p} \ge v_{n-1,p} + 1$;当$p < \frac{1}{2}$时,存在无穷多个$n$使得该不等式不成立。最后,本文指出对所有满足$0 < p \le 1$的$p$,序列$n - v_{n,p}$均收敛。

英文摘要:

You play the following game: you start out with $n$ coins that all have probability $p$ to land heads. You toss all of them and you then need to set aside at least one of them, which will not be tossed again. Now you repeat the process with the remaining coins. This continues (for at most $n$ rounds) until all coins have been set aside. Your goal is to maximize the total number of heads you end up with. In this paper we will prove that there exists a constant $p_0 \approx 0.5495021777642$ such that, if $p_0 < p \le 1$ and the number of remaining coins is large enough, then it is optimal to set aside exactly one coin every round, unless all coins landed heads. When $\frac{1}{2} \le p \le p_0$, it is optimal to set aside exactly one coin every round, unless at most one coin came up tails. Let $v_{n,p}$ be the expected number of heads you obtain when using the optimal strategy. We will show that $v_{n,p}$ is larger than or equal to $v_{n-1,p} + 1$ for all $n \ge 3$ and all $p \ge \frac{1}{2}$. When $p < \frac{1}{2}$ there are infinitely many $n$ for which this inequality does not hold. Finally, we will see that for every $p$ with $0 < p \le 1$ the sequence $n - v_{n,p}$ is convergent.

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

↑