Research map / Bandits and online learning / Online convex optimization and games
Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners
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.
Closest papers by meaning
- No-regret Learning in Price Competitions under Consumer Reference Effects (NeurIPS 2020 · similarity 0.89)
- No-Regret Learning in Dynamic Competition with Reference Effects Under Logit Demand (NeurIPS 2023 · similarity 0.89)
- No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests (NeurIPS 2024 · similarity 0.88)
- Convergence of No-Swap-Regret Dynamics in Self-Play (NeurIPS 2024 · similarity 0.87)
- Domination-Avoiding Learning Agents Cannot Collude (NeurIPS 2026 · similarity 0.87)
- No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics (NeurIPS 2026 · similarity 0.86)
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.