atlas

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

Regret Minimization and Convergence to Equilibria in General-sum Markov Games

ICML 2023 · Bandits and online learning › Online convex optimization and games · approach: Fast no-regret dynamics in games · 2 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 OOMD (optimistic mirror descent with log-barrier) as base algorithm inside swap-regret meta algorithm, instead of FTRLPolicy optimization in Markov games · Theoretical analysis, full-informationregret / path length adaptivityNo clear effect
Blocking mechanism (updates only at end of blocks) to get accurate Q estimates in unknown modelAlgorithm 1 in unknown dynamics · Unknown model with reachabilityswap regret exponent: T^{3/4} -> T^{8/9}Hurt
Independent transition function special case (agents affect only each other's losses)Algorithm 1 · Full-information independent transitionsindividual regret: O(log T) vs Õ(T^{3/4})Helped

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