How to lose as little as possible

Details How to lose as little as possible How to lose as little as possible

2010-02-09

arxiv.org/abs/1002.1763v2

Mathematics

Combinatorics

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

How to lose as little as possible does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with How to lose as little as possible, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and How to lose as little as possible will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-124185