One-armed bandit problem for parallel data processing systems
From MaRDI portal
Recommendations
- Robust normal two-armed bandit and parallel data processing
- Two-armed bandit problem for parallel data processing systems
- Gaussian two-armed bandit and optimization of batch data processing
- Finding minimax strategy and minimax risk in a random environment (the two-armed bandit problem)
- Gaussian two-armed bandit: limiting description
Cites work
- scientific article; zbMATH DE number 3831758 (Why is no real title available?)
- scientific article; zbMATH DE number 3845417 (Why is no real title available?)
- scientific article; zbMATH DE number 4078557 (Why is no real title available?)
- scientific article; zbMATH DE number 3359804 (Why is no real title available?)
- A Bayes Sequential Sampling Inspection Plan
- An Asymptotic Minimax Theorem for the Two Armed Bandit Problem
- On Sequential Designs for Maximizing the Sum of $n$ Observations
- Sequential medical trials
- Some aspects of the sequential design of experiments
- Two-armed bandit problem for parallel data processing systems
Cited in
(9)- Robust normal two-armed bandit and parallel data processing
- Gaussian two-armed bandit and optimization of batch data processing
- Two-armed bandit problem and batch version of the mirror descent algorithm
- Some monotonicity properties of parametric and nonparametric Bayesian bandits
- Gaussian two-armed bandit: limiting description
- Optimization of two-alternative batch processing with parameter estimation based on data inside batches
- Invariant description of control in a Gaussian one-armed bandit problem
- One-armed bandit problem and the mirror descent algorithm
- Parallel design of robust control in the stochastic environment (the two-armed bandit problem)
This page was built for publication: One-armed bandit problem for parallel data processing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259910)
