7 search results - page 2 / 2 » On the myopic policy for a class of restless bandit problems... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are N arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A play...
WIOPT
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...