The Nonstochastic Multiarmed Bandit Problem
Published in SIAM Journal on Computing • Jan 1, 2002
Authors:,,
Peter Auer
Nicolò Cesa‐Bianchi
Yoav Freund
Abstract
In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical 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 ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!