Approximation algorithms for restless bandit problems.
Sudipto GuhaKamesh MunagalaPeng ShiPublished in: J. ACM (2010)
Keyphrases
- approximation algorithms
- bandit problems
- decision problems
- np hard
- multi armed bandits
- special case
- optimal control
- minimum cost
- facility location problem
- vertex cover
- worst case
- approximation ratio
- primal dual
- np hardness
- network design problem
- open shop
- randomized algorithms
- set cover
- constant factor
- polynomial time approximation
- constant factor approximation
- machine learning
- multi armed bandit problems
- integer programming
- mathematical model
- probability distribution
- search algorithm
- learning algorithm