Fetching the paper…
Reading the bibliography…
Queueing systems are widely applicable stochastic models with use cases in communication networks, healthcare, service systems, etc.
Asymptotically efficient adaptive allocation rules
TL Lai and Herbert Robbins · 1985
Earlier work this paper cites.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
Leandros Tassiulas and Anthony Ephremides · 1992
Earlier work this paper cites.
Some inequalities for information divergence and related measures of discrimination
Flemming Topsøe · 2000
Earlier work this paper cites.
Finite-time analysis of the multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer · 2002
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 2002
Earlier work this paper cites.
Telephone call centers: Tutorial, review, and research prospects
Noah Gans, Ger Koole, and Avishai Mandelbaum · 2003
Earlier work this paper cites.
To queue or not to queue: Equilibrium behavior in queueing systems
Refael Hassin and Moshe Haviv · 2003
Earlier work this paper cites.
Dimensioning large call centers
Sem Borst, Avi Mandelbaum, and Martin I Reiman · 2004
Earlier work this paper cites.
Maximum pressure policies in stochastic processing networks
Jim G. Dai and Wuqin Lin · 2005
Earlier work this paper cites.
Elements of information theory (2. ed.)
Thomas M. Cover and Joy A. Thomas · 2006
Earlier work this paper cites.
Resource allocation and cross-layer control in wireless networks
Leonidas Georgiadis, Michael J Neely, Leandros Tassiulas, et al · 2006
Earlier work this paper cites.
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
Xiaojun Lin and Ness B Shroff · 2006
Earlier work this paper cites.
Efficient learning algorithms for changing environments
Elad Hazan and C. Seshadhri · 2009
Earlier work this paper cites.
Introduction to Nonparametric Estimation
Alexandre B. Tsybakov · 2009
Earlier work this paper cites.
Qualitative properties of alpha-weighted scheduling policies
Devavrat Shah, John N. Tsitsiklis, and Yuan Zhong · 2010
Earlier work this paper cites.
The kl-ucb algorithm for bounded stochastic bandits and beyond
Aurélien Garivier and Olivier Cappé · 2011
Earlier work this paper cites.
Or forum—little’s law as viewed on its 50th anniversary
John DC Little · 2011
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolò Cesa-Bianchi · 2012
Earlier work this paper cites.
Max weight learning algorithms for scheduling in unknown environments
Michael J. Neely, Scott Rager, and Thomas F. La Porta · 2012
Earlier work this paper cites.
Diagnostic accuracy under congestion
Saed Alizamir, Francis De Véricourt, and Peng Sun · 2013
Earlier work this paper cites.
Concentration inequalities: A nonasymptotic theory of independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Cited alongside, same era.
Combinatorial multi-armed bandit: General framework and applications
Wei Chen, Yajun Wang, and Yang Yuan · 2013
Cited alongside, same era.
Performance modeling and design of computer systems: queueing theory in action
Mor Harchol-Balter · 2013
Cited alongside, same era.
Matroid bandits: Fast combinatorial optimization with learning
Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, and Brian Eriksson · 2014
Cited alongside, same era.
Communication networks: an optimization, control, and stochastic networks perspective
R. Srikant and Lei Ying · 2014
Cited alongside, same era.
Two queues with non-stochastic arrivals
Decentralized learning in online queuing systems
Flore Sentenac, Etienne Boursier, and Vianney Perchet · 2021
Later among the works it cites.
Learning algorithms for minimizing queue length regret
Thomas Stahlbuhk, Brooke Shrader, and Eytan H. Modiano · 2021
Later among the works it cites.
Learning and information in stochastic networks and queues
Neil Walton and Kuang Xu · 2021
Later among the works it cites.
Stability of decentralized queueing networks beyond complete bipartite cases
Hu Fu, Qun Hu, and Jia’nan Lin · 2022
Later among the works it cites.
Optimal routing to parallel servers with unknown utilities—multi-armed bandit with queues
Xinzhe Fu and Eytan Modiano · 2022
Later among the works it cites.
Greedy algorithm for multiway matching with bounded regret
Varun Gupta · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Neil S. Walton · 2014
Cited alongside, same era.
On patient flow in hospitals: A data-based queueing-science perspective
Mor Armony, Shlomo Israelit, Avishai Mandelbaum, Yariv N Marmor, Yulia Tseytlin, and Galit B Yom-Tov · 2015
Cited alongside, same era.
Tight regret bounds for stochastic combinatorial semi-bandits
Branislav Kveton, Zheng Wen, Azin Ashkan, and Csaba Szepesvari · 2015
Cited alongside, same era.
On learning the c μ \mu rule in single and parallel server networks
Subhashini Krishnasamy, Ari Arapostathis, Ramesh Johari, and Sanjay Shakkottai · 2018
Cited alongside, same era.
Minimizing queue length regret under adversarial network models
Qingkai Liang and Eytan Modiano · 2018
Cited alongside, same era.
On the capacity of information processing systems
Laurent Massoulié and Kuang Xu · 2018
Cited alongside, same era.
Learning and hierarchies in service systems
Kostas Bimpikis and Mihalis G Markakis · 2019
Cited alongside, same era.
Integrated online learning and adaptive control in queueing systems with uncertain payoffs
Wei-Kang Hsu, Jiaming Xu, Xiaojun Lin, and Mark R Bell · 2022
Later among the works it cites.
Satisficing in time-sensitive bandit learning
Daniel Russo and Benjamin Van Roy · 2022
Later among the works it cites.
Feature-based priority queuing
Simrita Singh, Itai Gurvich, and Jan A Van Mieghem · 2022
Later among the works it cites.
Bayesian learning of optimal policies in markov decision processes with countably infinite state-space
Saghar Adler and Vijay Subramanian · 2023
Closest in time.
An online learning approach to dynamic pricing and capacity sizing in service systems
Xinyun Chen, Yunan Liu, and Guiyu Hong · 2023
Closest in time.
The price of anarchy of strategic queuing systems
Jason Gaitonde and Éva Tardos · 2023
Closest in time.
Queue scheduling with adversarial bandit learning
Jiatai Huang, Leana Golubchik, and Longbo Huang · 2023
Closest in time.
Learning to schedule in non-stationary wireless networks with unknown statistics
Quang Minh Nguyen and Eytan Modiano · 2023
Closest in time.
Constant regret primal-dual policy for multi-way dynamic matching
Yehua Wei, Jiaming Xu, and Sophie H Yu · 2023
Closest in time.
Learning while scheduling in multi-server systems with unknown statistics: Maxweight with discounted ucb
Zixian Yang, R Srikant, and Lei Ying · 2023
Closest in time.
The fragility of optimized bandit algorithms
Lin Fan and Peter W Glynn · 2024
Closest in time.
Efficient decentralized multi-agent learning in asymmetric bipartite queueing systems
Daniel Freund, Thodoris Lykouris, and Wentao Weng · 2024
Closest in time.
Learning to schedule in multiclass many-server queues with abandonment
Yueyang Zhong, John R Birge, and Amy R Ward · 2024
Closest in time.