Research map / Optimization / Nonconvex and smooth optimization
Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees.
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 Caratheodory exploration with time-expanding bounded-away polytope in semi-bandit online gradient descent | Online resource selection / congestion games · Congestion games | convergence to NE rate and regret | Helped |
| Set gamma_t = m^{-1/2}-scaled step and mu_t = m^{-1/2} t^{-1/4} for better regret | SBGD-CE · Regret theory | regret exponent | Mixed |
| Empirical exploitability of SBGD-CE on chain network congestion games | SBGD-CE · Network congestion games (19 nodes, 2 parallel edges) | exploitability | Helped |
Closest papers by meaning
- Learning in Congestion Games with Bandit Feedback (NeurIPS 2022 · similarity 0.94)
- Learning with Bandit Feedback in Potential Games (NeurIPS 2017 · similarity 0.90)
- Nash Regret Guarantees for Linear Bandits (NeurIPS 2023 · similarity 0.89)
- Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates (NeurIPS 2024 · similarity 0.88)
- The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback (ICML 2025 · similarity 0.87)
- Nash Social Welfare for Multi Armed Bandits: Trajectory-wise Expected and High Probability Regret (NeurIPS 2026 · similarity 0.87)
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.