Approximation Algorithms for Bayesian Multi-Armed Bandit Problems.
Sudipto GuhaKamesh MunagalaPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- multi armed bandit problems
- special case
- np hard
- worst case
- vertex cover
- facility location problem
- minimum cost
- np hardness
- bandit problems
- bayesian networks
- primal dual
- open shop
- network design problem
- set cover
- approximation ratio
- disjoint paths
- maximum likelihood
- genetic algorithm
- precedence constraints
- decision theory
- undirected graph
- strongly np hard
- upper bound
- decision making
- learning algorithm