Adaptive routing with end-to-end feedback

DOI10.1145/1007352.1007367zbMath1192.68020OpenAlexW2014482607MaRDI QIDQ3580958

Baruch Awerbuch, Robert D. Kleinberg

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007367

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10)

Related Items (17)

Adaptive routing with stale information ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ Multi-armed bandit problem with online clustering as side information ⋮ Dynamic choice in a complex world ⋮ Unnamed Item ⋮ Following the Perturbed Leader to Gamble at Multi-armed Bandits ⋮ Combinatorial bandits ⋮ Randomized prediction of individual sequences ⋮ Learning in Combinatorial Optimization: What and How to Explore ⋮ Online linear optimization and adaptive routing ⋮ Regret bounded by gradual variation for online convex optimization ⋮ Sequential Shortest Path Interdiction with Incomplete Information ⋮ Management of Variable Data Streams in Networks ⋮ Efficient Online Linear Optimization with Approximation Algorithms ⋮ Efficient algorithms for online decision problems ⋮ Online Learning of Nash Equilibria in Congestion Games ⋮ Small-Loss Bounds for Online Learning with Partial Information

This page was built for publication: Adaptive routing with end-to-end feedback