Bandit Processes and Dynamic Allocation Indices
John C. Gittins · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1979
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.
Cited by 1,487 works. doi:10.1111/j.2517-6161.1979.tb01068.x
Authors
References
- Applied Statistical Decision Theory
- Some aspects of the sequential design of experiments
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Applied Statistical Decision Theory.
- Discounted Dynamic Programming
- Great Expectations: The Theory of Optimal Stopping.
- The Art and Theory of Dynamic Programming
- A PROBLEM IN THE SEQUENTIAL DESIGN OF EXPERIMENTS
- Great Expectations: The Theory of Optimal Stopping.
- Adaptive Treatment Assignment Methods and Clinical Trials