Approximation algorithms for restless bandit problems

DOI10.1145/1870103.1870106zbMath1327.91021DBLPjournals/jacm/GuhaMS10OpenAlexW2040774021WikidataQ56570384 ScholiaQ56570384MaRDI QIDQ2999784

Sudipto Guha, Peng Shi, Kamesh Munagala

Publication date: 16 May 2011

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1870103.1870106

zbMATH Keywords

stochastic controlapproximation algorithmsmulti-armed banditsrestless bandits

Mathematics Subject Classification ID

Approximation algorithms (68W25) Probabilistic games; gambling (91A60)

Related Items (7)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ Polymatroid Prophet Inequalities ⋮ Optimal Bayesian strategies for the infinite-armed Bernoulli bandit ⋮ Nonstationary Bandits with Habituation and Recovery Dynamics ⋮ Matroid prophet inequalities and applications to multi-dimensional mechanism design ⋮ Approximations of the Restless Bandit Problem ⋮ Unnamed Item

This page was built for publication: Approximation algorithms for restless bandit problems