atlas

Research map / Bandits and online learning / Online convex optimization and games

Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games

NeurIPS 2022 · Bandits and online learning › Online convex optimization and games · approach: Last-iterate convergence in games · 1 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use OMD with Euclidean regularization and learning rate η = 0.1 instead of the Nash equilibrium outcome3×3 bimatrix game · 3×3 bimatrix gamesocial welfare: 0.5833 -> 0.9819Helped
Run OMD with Euclidean regularization for 1000 iterations3×3 bimatrix game · 3×3 bimatrix gamestrong CCE parameter: 0.1525Helped
Run OMD for 5000 iterationsOMD · Goofspielstrong CCE parameter: 0.0637Helped
Use OMD in the zero-sum instance rather than a general-sum instanceOMD · Liar's Dicelast-iterate Nash gapHelped
Continue OMD dynamics beyond the initial apparent approach toward Nash equilibriumOMD · Goofspielaverage-distribution CCE gap: 600Helped

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy