atlas

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

Provable Self-Play Algorithms for Competitive Reinforcement Learning

ICML 2020 · Bandits and online learning › RL theory and MDPs · approach: Linear function approximation in RL · 44 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 VI-ULCB, maintaining optimistic and pessimistic value estimates and jointly choosing policies via general-sum equilibriaZero-sum Markov games · General Markov Gameregret: ˜O(√(H3S2ABT))Helped
Use reward-free exploration before value iteration and exploitation instead of VI-ULCB throughout playZero-sum Markov games · General Markov Gameregret: ˜O((H5S2ABT2)1/3) versus ˜O(√(H3S2ABT))Mixed
Specialize VI-ULCB to turn-based gamesVI-ULCB · Turn-Based Markov Gameregret: ˜O(√(H3S2ABT)) to ˜O(√(H3S2(A + B)T))Helped
Use mirror descent in the one-step game settingZero-sum Markov games · One-step simultaneous gameweak regret: ˜O(√(S(A + B)T))Helped
Use mirror descent in the two-step turn-based settingZero-sum Markov games · Two-step turn-based gameweak regret: ˜O(√(S(A + B)T))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