arXiv:2606. 00835v1 Announce Type: new Abstract: Network routers that enforce Quality-of-Service (QoS) guarantees must decide, at every clock cycle, which expiring packet of information to transmit, even when the value of the packet is unknown until it is processed.
By Gianmarco Genalti, Achraf Azize, Vianney Perchet
The paper investigates TCP acknowledgment strategies that aim to minimize both acknowledgment and waiting costs. It establishes that no deterministic online algorithm can achieve a competitive ratio better than 2, and shows that achieving sublinear regret requires at least $k$ randomized online experts.
By Tsubasa Harada, Yasushi Kawase, Hanna Sumita
arXiv:2112. 06362v5 Announce Type: replace Abstract: We consider the problem of scheduling in multi-class, parallel-server queuing systems with uncertain rewards from job-server assignments.
By Jung-hun Kim, Milan Vojnovic
arXiv:2609.37660v1 Announce Type: new
Abstract: We study nonpreemptive contextual queueing bandits in a single-server system. Each job is represented by a $d$-dimensional context vector; in each roun...
By Wansoo Choi, Seoungbin Bae, Dabeen Lee
arXiv:2606. 09668v1 Announce Type: new Abstract: Contextual queueing bandits provide a framework for learning to schedule heterogeneous jobs under unknown context-dependent service rates.
By Seoungbin Bae, Dabeen Lee
arXiv:2602. 16965v2 Announce Type: replace Abstract: We study the decentralized multi-player stochastic bandit problem over a continuous, Lipschitz-structured action space where hard collisions yield zero reward.
By Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni, Lijun Chen