Online learning for traffic navigation in congested networks

MaRDI QIDQ7022750zbMATH OpenFDO

Authors Sreenivas Gollapudi, Kostas Kollias, Chinmay Maheshwari, Manxi Wu

Publication date 24 February 2025

Full work available at URL https://proceedings.mlr.press/v201/gollapudi23a.html

zbMATH Keywords

congestion gamesonline learningregret analysistraffic networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A decision-theoretic generalization of on-line learning and an application to boosting
• A payoff-based learning procedure and its application to traffic games
• Asymptotically efficient adaptive allocation rules
• Bandit algorithms
• Combinatorial bandits
• Efficiency and fairness of system-optimal routing with user constraints
• Efficient algorithms for online decision problems
• scientific article; zbMATH DE number 3128728 (Why is no real title available?)
• scientific article; zbMATH DE number 2119661 (Why is no real title available?)
• Learning Theory
• Multiplicative updates outperform generic no-regret learning in congestion games (extended abstract)
• Online linear optimization and adaptive routing
• Potential games
• Robbing the bandit
• Routing without regret, on convergence to Nash equilibria of regret-minimizing algorithms in routing games
• Selfish Routing in Capacitated Networks
• Stochastic Online Shortest Path Routing: The Value of Feedback
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• The Nonstochastic Multiarmed Bandit Problem
• The price of fairness
• The weighted majority algorithm
• Traffic assignment problem for a general network

This page was built for publication: Online learning for traffic navigation in congested networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022750)