Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
From MaRDI portal
Publication:3580958
Recommendations
Cited in
(20)- The on-line shortest path problem under partial monitoring
- Randomized prediction of individual sequences
- Adaptive routing with stale information
- The Shortest Path Problem Under Partial Monitoring
- scientific article; zbMATH DE number 7370642 (Why is no real title available?)
- Dynamic choice in a complex world
- Learning in combinatorial optimization: what and how to explore
- Management of Variable Data Streams in Networks
- Regret bounded by gradual variation for online convex optimization
- Combinatorial bandits
- Small-Loss Bounds for Online Learning with Partial Information
- Approximating Wardrop equilibria with finitely many agents
- Efficient algorithms for online decision problems
- Online learning of Nash equilibria in congestion games
- Following the Perturbed Leader to Gamble at Multi-armed Bandits
- Online linear optimization and adaptive routing
- Sequential Shortest Path Interdiction with Incomplete Information
- Efficient online linear optimization with approximation algorithms
- scientific article; zbMATH DE number 3896627 (Why is no real title available?)
- Multi-armed bandit problem with online clustering as side information
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)