Generalized Bandit Problems
From MaRDI portal
Publication:5486926
DOI10.1007/3-540-27295-X_6zbMath1255.91076MaRDI QIDQ5486926
Publication date: 18 September 2006
Published in: Social Choice and Strategic Decisions (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dynamic programming and statistical decision theory
- Asymptotically efficient adaptive allocation rules
- Arm-acquiring bandits
- Optimal learning with costly adjustment
- The Sequential Design of Bernoulli Experiments Including Switching Costs
- Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost
- Contributions to the "Two-Armed Bandit" Problem
- Optimal Search for the Best Alternative
- Denumerable-Armed Bandits
- A class of bandit problems yielding myopic optimal strategies
- Bayesian dynamic programming
- Switching Costs and the Gittins Index
- Discounted Dynamic Programming