Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks
Stochastic Network Optimization (SNO) concerns scheduling in stochastic queueing systems and has been widely studied in network theory. Classical SNO algorithms require network conditions to be stationary w.r.t. time, which fails to capture the non-stationary components in increasingly many real-wor...
Main Authors: | Dai, Yan, Huang, Longbo |
---|---|
Other Authors: | Massachusetts Institute of Technology. Operations Research Center |
Format: | Article |
Language: | English |
Published: |
ACM
2025
|
Online Access: | https://hdl.handle.net/1721.1/158129 |
Similar Items
-
Output-weighted sampling for multi-armed bandits with extreme payoffs
by: Yang, Yibo, et al.
Published: (2024) -
Enhanced hop-by-hop routing algorithms for underwater acoustic sensor networks /
by: Moeen Ud Din Tariq, 1981-, author 604984
Published: (2017) -
Enhanced hop-by-hop routing algorithms for underwater acoustic sensor networks /
by: Moeen Ud Din Tariq, 1981-, author 604984, et al.
Published: (2017) -
Optimal Slicing and Scheduling with Service Guarantees in Multi-Hop Wireless Networks
by: Jones, Nicholas, et al.
Published: (2024) -
Graph generative adversarial network
by: Tjeng, Stefan Setyadi
Published: (2018)