Multi-Agent Reinforcement Learning In Stochastic Games: From Alphago To Robust Control
summary
Shows that a simple model-based multi-agent RL plug-in estimator achieves nearly minimax sample complexity scaling with state count S, action counts a1+a2, discount factor and error ε, and matches a lower bound up to constants. Constructs a fully decentralized Q-learning algorithm with two-time-scale updates that provably converges to Nash in two-player zero-sum stochastic games and is rational against stationary opponents. Analyzes linear quadratic games where policy optimization with a two-loop scheme attains global convergence, preserves robustness via implicit regularization, and can beat LMI/SDP solvers in practice.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:23Background
- 0:39Prelude
- 2:42Motivation
- 3:25Our Answer
- 5:11Recall: Why is Multi-agent RL Challenging?
- 6:02Why is Decentralized Learning Important?
- 7:20Decentralized Q-Learning Dynamics
- 8:04Features of the Learning Dynamics
- 9:24Another Fundamental Class of Stochastic Games
- 10:19A Unified Model for Robust/Risk-sensitive Control
- 10:51Landscape & Algorithm
- 11:15Landscape Cont'd
- 11:45Implicit Regularization
- 13:08Concluding Remarks
related talks
31mStable Reinforcement Learning with Unbounded State Space
31mLearning to Control Unknown Systems
01h 05mFoundations of RL
42mA Regret Minimization Approach to Mutli-Agent Control and RL
37mSelfish Robustness and Equilibria in Multi-Player Bandits
30mLearning Multi-Agent Collaborations With Decomposition
42mReinforcement Learning using Generative Models for Continuous State and Action Space Systems
54mGeneralization and Robustness in Offline Reinforcement Learning
