atlas

Research map / Optimization / Nonconvex and smooth optimization

Can We Find Nash Equilibria at a Linear Rate in Markov Games?

ICLR 2023 · Optimization › Nonconvex and smooth optimization · approach: Equilibrium learning in zero-sum games · 0 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 Homotopy-PO with Averaging OGDA as Global-Slow and OGDA as Local-FastTwo-player zero-sum discounted Markov games · Random zero-sum Markov games, 10 trialsNash gap: less than $10^{-5}$ after $2\times 10^5$ iterationsHelped
Replace the comparison algorithm with Homotopy-PORandom zero-sum Markov games, $\gamma = 0.5$ · Random zero-sum Markov games, $\gamma = 0.5$Nash gapHelped
Use $2^k$ Global-Slow iterations followed by $\ceil{2.1^k}$ Local-Fast iterations instead of $2^k$ and $4^k$ (ablation)Homotopy-PO · Random zero-sum Markov gamesNash gap: less than $10^{-3}$ after $2\times 10^5$ iterations; less than $10^{-6}$ or even $10^{-8}$ in about $2\times 10^5$ iteraHelped
Run Averaging OGDA during a Global-Slow segment instead of OGDAHomotopy-PO · Random zero-sum Markov gamesNash gapMixed

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