atlas

Research map / Bandits and online learning / RL theory and MDPs

Online Learning in Unknown Markov Games

ICML 2021 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 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 a tunable G ≥ 1 and balance the square-root and linear-in-K termsV-ol in unknown Markov games · Unknown Markov gamesregret against minimax value: O(√(GH^5 SAKι) + KH/G) → Õ(K^{2/3}) (plus the stated H and S factors)Helped
Set G = 1, as in V-sp (ablation)V-ol in unknown Markov games · Unknown Markov gamesregret against minimax value: linear in KHurt
Learn more aggressively by favoring recent samples with α_t = (GH + 1)/(GH + t), and use the corresponding larger η_tV-ol relative to V-sp · Online Markov gamesregret: linear in K → Õ(K^{2/3})Helped
Compete with the minimax value instead of the best response in hindsightOnline learning in unknown Markov games · Unknown Markov gamesregret benchmark: Ω(min{√(2^H K), K})Mixed
Avoid maintaining a Q-table and update state values insteadV-ol · Unknown Markov gamesdependence of regret on opponent action-space sizeHelped

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