Approximation algorithms for restless bandit problems
From MaRDI portal
(Redirected from Publication:4633808)
Approximation algorithms for restless bandit problems (scientific article; zbMATH DE number 7051169)
Approximation algorithms for restless bandit problems (scientific article; zbMATH DE number 7051169)
Recommendations
Cited in
(18)- An online algorithm for the risk-aware restless bandit
- Multi-machine preventive maintenance scheduling with imperfect interventions: a restless bandit approach
- Approximate indexability and bandit problems with concave rewards and delayed feedback
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
- Approximation algorithms for restless bandit problems
- Multi-armed restless bandits, index policies, and dynamic priority allocation
- scientific article; zbMATH DE number 4059270 (Why is no real title available?)
- scientific article; zbMATH DE number 4087408 (Why is no real title available?)
- On an index policy for restless bandits
- Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
- Opportunistic Scheduling as Restless Bandits
- Approximations of the restless bandit problem
- Regret bounds for restless Markov bandits
- Monotone policies and indexability for bidirectional restless bandits
- An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits
- Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
- Some indexable families of restless bandit problems
- Dynamic priority allocation via restless bandit marginal productivity indices
This page was built for publication: Approximation algorithms for restless bandit problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633808)
