New algorithms for online packet scheduling with deadlines and partial feedback achieve Õ(√(KT)) α-regret and break the golden-ratio competitive ratio barrier for finite packet types.
arXiv preprint arXiv:2410.21266 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Packet Scheduling with Deadlines and Learning
New algorithms for online packet scheduling with deadlines and partial feedback achieve Õ(√(KT)) α-regret and break the golden-ratio competitive ratio barrier for finite packet types.