Chapter 302
📝Draft

Multi-Agent RL

When multiple agents learn and interact together

Prerequisites:

What You'll Learn

  • Explain challenges unique to multi-agent settings
  • Distinguish cooperative, competitive, and mixed settings
  • Describe independent learning and its limitations
  • Explain centralized training with decentralized execution (CTDE)
  • Implement simple multi-agent algorithms
  • Understand game-theoretic concepts like Nash equilibrium and self-play

So far, our agent has been alone in its environment. But most interesting problems involve multiple decision-makers: autonomous vehicles sharing roads, robots cooperating in a warehouse, or AIs competing in games. When multiple agents learn simultaneously, everything changes.

Imagine playing chess. You’re not just optimizing against a static puzzle—you’re facing an opponent who adapts to your strategies. Every time you find a clever tactic, they might find a counter. The “optimal” move depends on what your opponent will do, which depends on what they think you’ll do, which depends on…

This recursive reasoning is the essence of multi-agent RL. The environment includes other thinking, learning entities. And that changes everything.

Chapter Overview

The Big Picture

📖Multi-Agent RL

Reinforcement learning with multiple agents that interact in a shared environment. Each agent’s optimal behavior depends on the behaviors of other agents, creating complex strategic dynamics that go beyond single-agent optimization.

In multi-agent RL, each agent faces a moving target: other agents are learning too, changing the environment dynamics. Simple independent learning often fails because the environment appears non-stationary. The solution: train agents together (centralized) but deploy them independently (decentralized).

Consider three types of multi-agent scenarios:

Cooperative: A team of robots assembling a car. They share a goal and succeed or fail together. Communication and coordination are key.

Competitive: Two players in a zero-sum game like chess. One’s gain is the other’s loss. Strategy and adaptation are key.

Mixed: Traffic at an intersection. Everyone wants to get through quickly, but crashes hurt everyone. Some coordination emerges, but incentives aren’t fully aligned.

Each type brings different challenges and requires different approaches.

Why Multi-Agent RL Matters

Real-World Multi-Agent Systems
  • Autonomous vehicle fleets
  • Warehouse robotics teams
  • Smart grid coordination
  • Trading agents in markets
Notable Achievements
  • OpenAI Five: defeated the Dota 2 world champions (OG, 2019)
  • AlphaStar: Grandmaster-level StarCraft II
  • Multi-agent hide and seek emergence
  • Cooperative manipulation tasks
💡Start Here

New to multi-agent RL? Begin with Multi-Agent Settings to understand the different types of multi-agent problems, then continue through the sections in order.


Check Your Understanding

Check your understanding
1. Why does independent Q-learning (IQL) lose Q-learning's convergence guarantee in multi-agent settings?
2. What defines centralized training with decentralized execution (CTDE)?
3. In a centralized-critic actor-critic method, what does the critic see that a single-agent critic would not?
4. What problem does QMIX's mixing network solve for cooperative teams?
5. Why is self-play effective for training competitive agents?
  1. Other agents change everything
    When the environment contains learners, each agent faces a moving target and single-agent guarantees dissolve.
  2. Three motive structures
    Cooperative (shared reward), competitive (zero-sum), and mixed-motive settings each demand different methods.
  3. Independent learning is a gamble
    IQL is simple and sometimes sufficient, but non-stationarity means it can miscoordinate or cycle indefinitely.
  4. CTDE is the workhorse paradigm
    Centralized critics and value decomposition (QMIX) exploit privileged training information while keeping execution decentralized.
  5. Self-play builds its own curriculum
    Playing against copies of yourself scales opponent strength automatically—with cycling as the known failure mode.

Primary Sources

  • Littman (1994), “Markov Games as a Framework for Multi-Agent Reinforcement Learning,” ICML 1994 — the Markov game formulation and minimax-Q
  • Lowe et al. (2017), “Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments,” NeurIPS 2017 — MADDPG, the canonical centralized-critic CTDE method. arXiv:1706.02275
  • Rashid et al. (2018), “QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning,” ICML 2018 — value decomposition with a monotonic mixing network. arXiv:1803.11485
Next ChapterOffline RL