arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1002.1763math.COmath.PR
收藏

如何尽可能少地失去

How to lose as little as possible

Vittorio Addona, Stan Wagon, Herb Wilf

摘要:

假设爱丽丝有一个正面朝上概率为$q$的硬币,鲍勃有一个正面朝上概率为$p>q$的硬币。现在他们每个人都要抛硬币$n$次,如果爱丽丝得到的正面比鲍勃多,她就会赢。显然,这个游戏对鲍勃有利,但是对于给定的$p,q$,选择什么样的$n$才能最大限度地提高爱丽丝的获胜机会呢?确定最佳$N$的问题首先出现在\cite{wa}中。我们证明了$n$的$N(q,p)$存在一个本质上唯一的值,它使弱币获胜的概率$f(n)$最大化,并且它满足$\frac{1}{2(p-q)}-\frac12\le N(q,p)\le \frac{\max{(1-p,q)}}{p-q}$。该分析使用Zeilberger算法的多元形式,找到一个指示函数$J_n(q,p)$,使$J>0$当且仅当$n<N(q,p)$,然后仔细研究这个函数,它是两个勒让德多项式的线性组合。给出了一种基于积分的计算$N(q,p)$的算法。

英文摘要:

Suppose Alice has a coin with heads probability $q$ and Bob has one with heads probability $p>q$. Now each of them will toss their coin $n$ times, and Alice will win iff she gets more heads than Bob does. Evidently the game favors Bob, but for the given $p,q$, what is the choice of $n$ that maximizes Alice's chances of winning? The problem of determining the optimal $N$ first appeared in \cite{wa}. We show that there is an essentially unique value $N(q,p)$ of $n$ that maximizes the probability $f(n)$ that the weak coin will win, and it satisfies $\frac{1}{2(p-q)}-\frac12\le N(q,p)\le \frac{\max{(1-p,q)}}{p-q}$. The analysis uses the multivariate form of Zeilberger's algorithm to find an indicator function $J_n(q,p)$ such that $J>0$ iff $n<N(q,p)$ followed by a close study of this function, which is a linear combination of two Legendre polynomials. An integration-based algorithm is given for computing $N(q,p)$.

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

↑