This is a preview. Log in through your library . Abstract We study a two-player one-arm bandit problem in discrete time, in which the risky arm can have two possible types, high and low, the decision ...

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 ...