Some indexable families of restless bandit problems

By Kevin D. Glazebrook, Diego Ruiz-Hernández, Christopher Kirkbride. Advances in Applied Probability, 2006

114 citations recorded by the source corpus.

Subfields: Electrical and Electronic Engineering, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/58249f1c18972f754e708135b9f639d30ed79851

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Electrical and Electronic Engineering

1. Keqin Liu
2. Qing Zhao
3. Ido Erev
4. Guido Biele
5. Eyal Ert
6. Kobi Cohen
7. Oshri Naparstek
8. Brian M. Sadler

In Management Science and Operations Research

1. Eyal Ert
2. Ido Erev
3. Guido Biele
4. Aleksandrs Slivkins
5. Kobi Cohen
6. Oshri Naparstek

Citations in the corpus

• Indexability of Restless Bandit Problems and Optimality of Whittle Index for Dynamic Multichannel Access (2008, background): “For example, it has applications in target tracking as considered in [16], whereK unmanned aerial vehicles are tracking the states ofN (N > K) targets in each slot.”
• Learning, risk attitude and hot stoves in restless bandit problems (2009, methodology): “Therefore, heuristic solutions to the dilemmahave been proposed (e.g. Glazebrook, Ruiz-Hernandez, and Kirkbride (2006)).”