Low-complexity algorithm for restless bandits with imperfect observations
Year of publication: |
2024
|
---|---|
Authors: | Liu, Keqin ; Weber, Richard R. ; Zhang, Chengzhong |
Subject: | Continuous state space | Index policy | Observation errors | Restless bandits | Theorie | Theory | Algorithmus | Algorithm | Wahrscheinlichkeitsrechnung | Probability theory |
-
Logical probabilistic analysis and its history
Ryabinen, Igor A., (2015)
-
Gast, Nicolas, (2024)
-
On the computation of Whittle's index for Markovian restless bandits
Ayesta, Urtzi, (2021)
- More ...
-
The Cafeteria Process--Tandem Queues With 0-1 Dependent Service Times and the Bowl Shape Phenomenon
Weber, Richard R., (1994)
-
Note---On the Marginal Benefit of Adding Servers to G/GI/m Queues
Weber, Richard R., (1980)
-
On an index policy for restless bandits
Weber, Richard R., (1990)
- More ...