Answers are grounded in this paper and cite their sources.
Summary The paper aims to give a unified account of the central concepts in recent work on bandit processes and dynamic allocation indices; to show how these reduce some previously intractable problems to the problem of calculating such indices; and to describe how these calculations may be carried out. Applications to stochastic scheduling, sequential clinical trials and a class of search problems are discussed.
No takes yet. Share an insight, caveat, or question.
John Gittins (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: