Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
From MaRDI portal
Publication:3580958
DOI10.1145/1007352.1007367zbMATH Open1192.68020OpenAlexW2014482607MaRDI QIDQ3580958FDOQ3580958
Authors: 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
Recommendations
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10)
Cited In (20)
- The Shortest Path Problem Under Partial Monitoring
- Small-Loss Bounds for Online Learning with Partial Information
- Combinatorial bandits
- Adaptive routing with stale information
- Regret bounded by gradual variation for online convex optimization
- Following the Perturbed Leader to Gamble at Multi-armed Bandits
- Online learning of Nash equilibria in congestion games
- Management of Variable Data Streams in Networks
- Title not available (Why is that?)
- The on-line shortest path problem under partial monitoring
- Randomized prediction of individual sequences
- Approximating Wardrop equilibria with finitely many agents
- Efficient algorithms for online decision problems
- Sequential Shortest Path Interdiction with Incomplete Information
- Multi-armed bandit problem with online clustering as side information
- Title not available (Why is that?)
- Efficient Online Linear Optimization with Approximation Algorithms
- Learning in Combinatorial Optimization: What and How to Explore
- Dynamic choice in a complex world
- Online linear optimization and adaptive routing
This page was built for publication: Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580958)
