On the Optimal Amount of Experimentation in Sequential Decision Problems
Preprint
Abstract
We provide a tight bound on the amount of experimentation under the optimal strategy in sequential decision problems. We show the applicability of the result by providing a bound on the cut-off in a one-arm bandit problem.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Informational externalities and emergence of consensusGames and Economic Behavior, 2009
- Social Learning in One-Arm Bandit ProblemsEconometrica, 2007
- Strategic Experimentation with Exponential BanditsEconometrica, 2005
- Incomplete Learning from Endogenous Data in Dynamic AllocationEconometrica, 2000
- Strategic ExperimentationEconometrica, 1999
- Nearly Optimal Sequential Tests of Composite HypothesesThe Annals of Statistics, 1988
- Adaptive Treatment Allocation and the Multi-Armed Bandit ProblemThe Annals of Statistics, 1987
- Bandit Processes and Dynamic Allocation IndicesJournal of the Royal Statistical Society Series B: Statistical Methodology, 1979
- A Bernoulli Two-armed BanditThe Annals of Mathematical Statistics, 1972
- Some Remarks on the Two-Armed BanditThe Annals of Mathematical Statistics, 1970