Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
From MaRDI portal
Publication:4530639
Recommendations
- Approximation algorithms for restless bandit problems
- Index policies for a class of discounted restless bandits
- Restless bandits, partial conservation laws and indexability
- On the asymptotic optimality of greedy index heuristics for multi-action restless bandits
- Some indexable families of restless bandit problems
Cited in
(18)- A general theory of multiarmed bandit processes with constrained arm switches
- \(r\)-extreme signalling for congestion control
- Nonstationary bandits with habituation and recovery dynamics
- An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits
- Group maintenance: a restless bandits approach
- Decomposable Markov decision processes: A fluid optimization approach
- Resource competition in virtual network embedding
- Linear programming relaxations and marginal productivity index policies for the buffer sharing problem
- Prioritizing hepatitis C treatment in U.S. prisons
- Coding and control for communication networks
- Efficiency in lung transplant allocation strategies
- On the Gittins index in the M/G/1 queue
- Approximation algorithms for restless bandit problems
- The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
- Optimal online learning for nonlinear belief models using discrete priors
- Index policies for the maintenance of a collection of machines by a set of repairmen
- Approximation algorithms for restless bandit problems
- Optimal exploration-exploitation in a multi-armed bandit problem with non-stationary rewards
This page was built for publication: Restless Bandits, Linear Programming Relaxations, and a Primal-Dual Index Heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530639)
