Research map / Optimization / Nonconvex and smooth optimization
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights
Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use ACCELEWEIGHT in a stochastic environment | ACCELEWEIGHT · Routing game with noisy costs (24 vertices, 276 edges) | convergence of F(X_T)-F(x*) | Hurt |
| use ADAWEIGHT instead of ACCELEWEIGHT in a stochastic environment | ADAWEIGHT · Routing game with noisy costs (24 vertices, 276 edges) | convergence of F(X_T)-F(x*) | Improved |
| badly tuned initial step size for ACCELEWEIGHT (ablation) | ACCELEWEIGHT · SiouxFalls network | convergence | Hurt |
| vary initial step size for ADAWEIGHT (parameter-agnostic) (ablation) | ADAWEIGHT · SiouxFalls network | convergence | No clear effect |
Closest papers by meaning
- The route to chaos in routing games: When is price of anarchy too optimistic? (NeurIPS 2020 · similarity 0.88)
- Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos (NeurIPS 2017 · similarity 0.88)
- Information Design for Congestion Games with Unknown Demand (AAAI 2024 · similarity 0.86)
- The Complexity of Optimizing Atomic Congestion (AAAI 2024 · similarity 0.86)
- Accelerated Regularized Learning in Finite N-Person Games (NeurIPS 2024 · similarity 0.85)
- Prediction-Aware Learning in Multi-Agent Systems (ICML 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
