The two-armed bandit
Biometrika · 1975 · Volume 62 · Issue 2
Abstract
The optimal dynamic programming approach to the solution of the two-armed bandit problem is discussed and the suboptimal play-the-winner and one-step-ahead sampling rules are compared with it.
Enable JavaScript for citation tools and additional paper interactions.