atlas

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

Online Reinforcement Learning in Stochastic Games

NeurIPS 2017 · Bandits and online learning › RL theory and MDPs · approach: Regret bounds with function approximation · 7 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 UCSG instead of R-max for online learning under the comparable average-reward SG settingOnline average-reward stochastic games · Average-reward SG, Assumption 2regret: R-max: \tilde{\mathcal{O}}\left(\frac{D^3S^2A}{\varepsilon^6}\right); UCSG: \tilde{\mathcal{O}}(\sqrt[3]{DS^2AT^2})Helped
Use UCSG's offline training procedure to find a maximin stationary policyUCSG · Average-reward SG, Assumption 1 (offline)sample complexity: \tilde{\mathcal{O}}(D^3S^5A+D^2S^2A/\varepsilon^2)Helped
Use UCSG's offline training procedure under the additional reachability assumptionUCSG · Average-reward SG, Assumption 2 plus additional reachability assumption (offline)sample complexity: \tilde{\mathcal{O}}(DS^2A/\varepsilon^3)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