Research map / Learning theory and algorithms / Submodular and game algorithms
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix
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
- Convergence of No-Swap-Regret Dynamics in Self-Play (NeurIPS 2024 · similarity 0.94)
- The Equivalence of Dynamic and Strategic Stability under Regularized Learning in Games (NeurIPS 2023 · similarity 0.94)
- No-regret Learning in Harmonic Games: Extrapolation in the Face of Conflicting Interests (NeurIPS 2024 · similarity 0.93)
- The impact of uncertainty on regularized learning in games (ICML 2025 · similarity 0.91)
- Learning from Delayed Feedback in Games via Extra Prediction (NeurIPS 2025 · similarity 0.91)
- No Coin Left Behind: Maximizing Strategic Surplus Against No-Regret Dynamics (NeurIPS 2026 · similarity 0.90)
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.