66 search results - page 6 / 14 » The Nonstochastic Multiarmed Bandit Problem |
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The multi-armed bandit is a concise model for the problem of iterated decision-making under uncertainty. In each round, a gambler must pull one of K arms of a slot machine, withou...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the restless multi-armed bandit (RMAB) problem with unknown dynamics. In this problem, at each time, a player chooses K out of N (N > K) arms to play. The state of ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
In this paper we consider the problem of actively learning the mean values of distributions associated with a finite number of options (arms). The algorithms can select which opti...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...