Learning in Strategic Queuing with Geometric Recharge: From Bandits to Systems
It is proved that any no-regret learner achieves a long-run average throughput of at least the Hamacher sum of the server rates, and that this bound is tight.
Cristian Palma Foster, Éva Tardos
· 0 citations