AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Learning While Playing in Mean-Field Games: Convergence and Optimality

ICML 2021 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games · 9 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
Single-loop fictitious play (one PPO-style policy improvement step plus mean-field update per iteration) instead of double-loop solving of the MDP induced by each mean-field stateMean-field game Nash equilibrium learning · Theoretical convergence (Theorem 1 / Corollary 1)convergence rate to entropy-regularized Nash equilibriumNo clear effect
Entropy regularization with parameter lambda added to the MFG objectiveMean-field game policy optimization · Theoretical convergence (Theorem 1)convergence rate bound scalingHelped
Relaxing the l-infinity concentrability condition (Assumption 4) to an l2 conditionFictitious play algorithm for MFG · Theoretical convergence (Theorem 2 / Corollary 2)convergence rate exponent: T^-1/5 to T^-1/9Hurt

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