Learning unknown service rates in queues : a multiarmed bandit approach
Year of publication: |
2021
|
---|---|
Authors: | Krishnasamy, Subhashini ; Sen, Rajat ; Johari, Ramesh ; Shakkottai, Sanjay |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 69.2021, 1, p. 315-330
|
Subject: | bandit algorithms | queueing systems | scheduling | regret | Warteschlangentheorie | Queueing theory | Scheduling-Verfahren | Scheduling problem | Lernprozess | Learning process |
-
Computationally efficient evaluation of appointment schedules in health care
De Vuyst, Stiijn, (2014)
-
When queueing is better than push and shove
Gershkov, Alex, (2006)
-
Prioritized customer order scheduling to maximize throughput
Zhao, Yaping, (2016)
- More ...
-
Asymptotic Behavior of Internet Congestion Controllers in a Many-Flows Regime
Deb, Supratim, (2005)
-
Online Collaborative-Filtering on Graphs
Banerjee, Siddhartha, (2014)
-
A Lyapunov theory for finite-sample guarantees of Markovian stochastic approximation
Chen, Zaiwei, (2024)
- More ...