2000 character limit reached
An Instance-Based Algorithm for Deciding the Bias of a Coin
Published 11 Nov 2020 in cs.DS | (2011.05502v1)
Abstract: Let $q \in (0,1)$ and $\delta \in (0,1)$ be real numbers, and let $C$ be a coin that comes up heads with an unknown probability $p$, such that $p \neq q$. We present an algorithm that, on input $C$, $q$, and $\delta$, decides, with probability at least $1-\delta$, whether $p<q$ or $p>q$. The expected number of coin flips made by this algorithm is $O \left( \frac{\log\log(1/\varepsilon) + \log(1/\delta)}{\varepsilon2} \right)$, where $\varepsilon = |p-q|$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.