Bandit Problems With Infinitely Many Arms

We consider a bandit problem consisting of a sequence of $n$ choices from an infinite number of Bernoulli arms, with $n \rightarrow \infty$. The objective is to minimize the long-run failure rate. The Bernoulli parameters are independent observations from a distribution $F$. We first assume $F$ to b...

Ausführliche Beschreibung