Results 61 to 70 of about 147 (138)

Lagrangian index policy for restless bandits with average reward

open access: yesQueueing Systems
We study the Lagrangian Index Policy (LIP) for restless multi-armed bandits with long-run average reward. In particular, we compare the performance of LIP with the performance of the Whittle Index Policy (WIP), both heuristic policies known to be asymptotically optimal under certain natural conditions.
Konstantin Avrachenkov   +2 more
openaire   +2 more sources

Model Predictive Control is Almost Optimal for Restless Bandit

open access: yesCoRR
Reviewed and accepted to COLT ...
Gast, Nicolas, Narasimha, Dheeraj
openaire   +3 more sources

Low-complexity algorithm for restless bandits with imperfect observations

open access: yesMathematical Methods of Operations Research
We consider a class of restless bandit problems that finds a broad application area in reinforcement learning and stochastic optimization. We consider $N$ independent discrete-time Markov processes, each of which had two possible states: 1 and 0 (`good' and `bad'). Only if a process is both in state 1 and observed to be so does reward accrue.
Keqin Liu   +2 more
openaire   +2 more sources

Caching Contents with Varying Popularity Using Restless Bandits

open access: yes
There were a mistakes while submitting updated version.
K. J. Pavamana, Chandramani Singh
openaire   +3 more sources

Home - About - Disclaimer - Privacy