Approximation algorithms for restless bandit problems
From MaRDI portal
Recommendations
Cited in
(23)- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
- Nonstationary bandits with habituation and recovery dynamics
- An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits
- Matroid prophet inequalities and applications to multi-dimensional mechanism design
- scientific article; zbMATH DE number 4059270 (Why is no real title available?)
- Approximation algorithms for stochastic combinatorial optimization problems
- Adaptive policies for perimeter surveillance problems
- Approximations of the restless bandit problem
- An online algorithm for the risk-aware restless bandit
- Approximate indexability and bandit problems with concave rewards and delayed feedback
- Regret bounds for restless Markov bandits
- Optimal policies for observing time series and related restless bandit problems
- Polymatroid Prophet Inequalities
- Some indexable families of restless bandit problems
- LookAhead: the optimal non-decreasing index policy for a time-varying holding cost problem
- Low-complexity algorithm for restless bandits with imperfect observations
- Approximation algorithms for restless bandit problems
- Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
- A prophet inequality based approach to the adaptive ProbeTopK problem
- Optimal Bayesian strategies for the infinite-armed Bernoulli bandit
- Wireless channel selection with restless bandits
- Opportunistic Scheduling as Restless Bandits
- Improvements and generalizations of stochastic knapsack and Markovian bandits approximation algorithms
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 Q2999784)
