Skip to main content
Search

# Geometric Recharging Bandits

1 related articles

Subscribe to updates
  1. arXiv

    One-packet buffers let no-regret learners keep queues stable, and the extra capacity needed is now exact

    In a queuing system where each server holds a single packet, every queue runs an off-the-shelf no-regret learning algorithm without coordination or knowledge of service rates. Analysis shows a single queue's long-run throughput is at least the Hamacher sum of the service rates, a tight bound, and that a multi-queue system with arrival rates capped at λ needs an overprovisioning factor of exactly 1/(1-λ), tightening the prior 2-to-4 range to 2 at λ=1/2 and approaching 1 as λ vanishes.

You’re all caught up