![]() |
CiteULike | ![]() |
bsilverthorn's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Gambling in a rigged casino: the adversarial multi-armed bandit problemIn Proceedings of the 36th Annual Symposium on Foundations of Computer Science (1995), pp. 322-331.
|
Reviews
[Write a review of this article]
Notes for this article
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractIn the multi-armed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the trade-off between exploration (trying out each arm to find the best one) and exploitation (playing the arm believed to give the best payoff). Past solutions for the bandit problem have almost always relied on assumptions about the...
BibTeX record
RIS record