Answers are grounded in this paper and cite their sources.
A class of simple adaptive allocation rules is proposed for the problem (often called the "multi-armed bandit problem") of sampling x₁, ⋯ xN sequentially from k populations with densities belonging to an exponential family, in order to maximize the expected value of the sum SN = x₁ + ⋯ + xN. These allocation rules are based on certain upper confidence bounds, which are developed from boundary crossing theory, for the k population parameters. The rules are shown to be asymptotically optimal as N → ∞ from both Bayesian and frequentist points of view. Monte Carlo studies show that they also perform very well for moderate values of the horizon N.
No takes yet. Share an insight, caveat, or question.
Tze Leung Lai (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: