Approximation algorithms for restless bandit problems.
Sudipto GuhaKamesh MunagalaPeng ShiPublished in: SODA (2009)
Keyphrases
- approximation algorithms
- bandit problems
- decision problems
- np hard
- multi armed bandits
- special case
- worst case
- vertex cover
- optimal control
- minimum cost
- facility location problem
- np hardness
- network design problem
- randomized algorithms
- constant factor
- set cover
- polynomial time approximation
- multi armed bandit problems
- influence diagrams
- approximation ratio
- primal dual
- approximation schemes
- open shop
- disjoint paths
- constant factor approximation
- precedence constraints
- utility function
- computational complexity
- artificial intelligence
- genetic algorithm
- approximation guarantees
- evolutionary algorithm