Comments on “Finite-Time Analysis of the Multiarmed Bandit Problem”

Author(s):  
Lu-Ning Zhang ◽  
Xin Zuo ◽  
Jian-Wei Liu ◽  
Wei-Min Li ◽  
Nobuyasu Ito
1997 ◽  
Vol 11 (1) ◽  
pp. 65-78 ◽  
Author(s):  
Takashi Ishikida ◽  
Yat-wah Wan

A single server processes jobs that can yield rewards but expire on predetermined dates. Expected immediate rewards from each job are deteriorating. The instance is formulated as a multiarmed bandit problem, and an index-based scheduling policy is shown to maximize the expected total reward.


2008 ◽  
Vol 40 (02) ◽  
pp. 377-400 ◽  
Author(s):  
Savas Dayanik ◽  
Warren Powell ◽  
Kazutoshi Yamazaki

A multiarmed bandit problem is studied when the arms are not always available. The arms are first assumed to be intermittently available with some state/action-dependent probabilities. It is proven that no index policy can attain the maximum expected total discounted reward in every instance of that problem. The Whittle index policy is derived, and its properties are studied. Then it is assumed that the arms may break down, but repair is an option at some cost, and the new Whittle index policy is derived. Both problems are indexable. The proposed index policies cannot be dominated by any other index policy over all multiarmed bandit problems considered here. Whittle indices are evaluated for Bernoulli arms with unknown success probabilities.


2016 ◽  
Vol 61 (11) ◽  
pp. 3256-3268 ◽  
Author(s):  
Shahin Shahrampour ◽  
Alexander Rakhlin ◽  
Ali Jadbabaie

Sign in / Sign up

Export Citation Format

Share Document