UCB strategies and optimization of batch processing in a one-armed bandit problem
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244303321897663
- A Bayes Sequential Sampling Inspection Plan
- Adaptive treatment allocation and the multi-armed bandit problem
- An Asymptotic Minimax Theorem for the Two Armed Bandit Problem
- Bandit algorithms
- Batched bandit problems
- Finite-time analysis of the multiarmed bandit problem
- scientific article; zbMATH DE number 3831758 (Why is no real title available?)
- scientific article; zbMATH DE number 7038557 (Why is no real title available?)
- scientific article; zbMATH DE number 3845417 (Why is no real title available?)
- scientific article; zbMATH DE number 3846699 (Why is no real title available?)
- scientific article; zbMATH DE number 3919523 (Why is no real title available?)
- scientific article; zbMATH DE number 4078557 (Why is no real title available?)
- scientific article; zbMATH DE number 194374 (Why is no real title available?)
- scientific article; zbMATH DE number 3359804 (Why is no real title available?)
- On Bayesian index policies for sequential resource allocation
- On Sequential Designs for Maximizing the Sum of n Observations
- Prediction, Learning, and Games
- Sequential medical trials
Cited in
(3)
This page was built for publication: UCB strategies and optimization of batch processing in a one-armed bandit problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153269)