Multi-Agent Systems

Multi-Agent Systems (MAS) are computational frameworks in which multiple autonomous agents — each with its own perception, reasoning, and action capabilities — interact within a shared environment to achieve individual or collective goals. They matter in modern AI because many real-world tasks (robotic coordination, LLM-based pipelines, simulation, game-playing) are fundamentally too complex or too distributed for a single monolithic model to handle efficiently. A counterintuitive fact: emergent collective intelligence in MAS often arises from agents following extremely simple local rules, producing global behavior no individual agent was explicitly programmed to exhibit.

The core insight

The key insight is that decomposing a hard problem across specialized, communicating agents often outperforms a single large agent attempting everything — not because any individual agent is smarter, but because parallelism, specialization, and error-checking between agents compound into dramatically better outcomes. Think of it as the difference between one overloaded generalist and a well-coordinated team: the team's coordination overhead is real, but so is its ability to catch each other's mistakes and work simultaneously on different sub-problems. In modern LLM-based systems, this means a "planner" agent can decompose a task, "executor" agents can run tools or retrieve documents in parallel, and a "critic" agent can verify results — none of which need to be the same model. The "aha moment" is realizing that the communication protocol and trust model between agents is just as important as the intelligence of any single agent.

How It Works

A multi-agent system can be formally characterized as a tuple:

1
M=⟨A, E, S, {Pi}i∈A, {Acti}i∈A, T, {Ri}i∈A⟩\quad \mathcal{M} = \langle \mathcal{A},\, \mathcal{E},\, \mathcal{S},\, \{P_i\}_{i \in \mathcal{A}},\, \{Act_i\}_{i \in \mathcal{A}},\, T,\, \{R_i\}_{i \in \mathcal{A}} \rangle

Explanation: A MAS is fully described by its agents, environment, state space, per-agent perception functions, per-agent action sets, a joint transition function, and per-agent reward signals — analogous to a multi-player Markov game. Where:

  • A={1,…,n}\mathcal{A} = \{1, \ldots, n\} is the set of nn agents
  • E\mathcal{E} is the environment (may be physical, simulated, or a software execution context)
  • S\mathcal{S} is the global state space
  • Pi:S→OiP_i : \mathcal{S} \rightarrow O_i is agent ii's observation/perception function producing local observation oio_i
  • ActiAct_i is the action space available to agent ii
  • T:S×Act1×⋯×Actn→Δ(S)T : \mathcal{S} \times Act_1 \times \cdots \times Act_n \rightarrow \Delta(\mathcal{S}) is the stochastic joint transition function
  • Ri:S×a→RR_i : \mathcal{S} \times \mathbf{a} \rightarrow \mathbb{R} is agent ii's scalar reward function

The joint action a=(a1,…,an)\mathbf{a} = (a_1, \ldots, a_n) drives the next state, making this a Markov Game (also called a stochastic game):

2
st+1∼T(st, a1t, …, ant),ait∼πi(⋅∣oit)\quad s_{t+1} \sim T(s_t,\, a_1^t,\, \ldots,\, a_n^t), \qquad a_i^t \sim \pi_i(\cdot \mid o_i^t)

Explanation: Each agent samples its action from its own policy conditioned only on its local observation, and the joint action stochastically produces the next global state — agents cannot generally observe each other's internal reasoning. Each agent's objective in a cooperative setting is to maximize the expected discounted team return:

3
J(π1,…,πn)=Eπ ⁣[∑t=0∞γtRˉ(st,at)],Rˉ=1n∑i=1nRi\quad J(\pi_1, \ldots, \pi_n) = \mathbb{E}_{\pi}\!\left[\sum_{t=0}^{\infty} \gamma^t \bar{R}(s_t, \mathbf{a}_t)\right], \quad \bar{R} = \frac{1}{n}\sum_{i=1}^{n} R_i

Explanation: All agents share responsibility for the average team reward, weighted by discount factor γ ∈ (0,1) that down-weights distant future rewards — this shared objective is what "cooperative MAS" means mathematically. In practice, LLM-based multi-agent systems use a message-passing graph rather than joint RL. Define agents as nodes and communication channels as directed edges. At each step, agent ii produces an output:

4
mi(t)=LLMθi ⁣(sysi  ∥  {mj(t−1):j∈N−(i)}  ∥  ci(t))\quad m_i^{(t)} = \text{LLM}_{\theta_i}\!\bigl(\text{sys}_i \;\|\; \{m_j^{(t-1)} : j \in \mathcal{N}^-(i)\} \;\|\; c_i^{(t)}\bigr)

Explanation: Agent i's message at turn t is the LLM's output given its system prompt, all incoming messages from predecessor agents in the communication graph, and its current context (tool results, memory retrievals) — this is the LLM-agent analog of equation [2]. Where:

  • θi\theta_i are the (possibly shared) model weights for agent ii
  • sysi\text{sys}_i is agent ii's system prompt encoding its role and constraints
  • N−(i)\mathcal{N}^-(i) is the set of agents with edges pointing into ii
  • ci(t)c_i^{(t)} is agent ii's tool/memory context at time tt
  • ∥\| denotes prompt concatenation

The Nash Equilibrium condition — the central solution concept when agents are not fully cooperative — requires:

5
πi∗=arg⁡max⁡πiRi ⁣(πi, π−i∗)∀ i∈A\quad \pi_i^* = \arg\max_{\pi_i} R_i\!\left(\pi_i,\, \pi_{-i}^*\right) \quad \forall\, i \in \mathcal{A}

Explanation: At a Nash Equilibrium, no single agent can improve its own reward by unilaterally deviating from its policy, given that all other agents hold their policies fixed — this captures why self-interested agents may reach stable but globally suboptimal outcomes.

researcher · Michael Wooldridge | b. 1966 | Foundational Theory of Multi-Agent Systems

Wooldridge is a British computer scientist and professor at the University of Oxford whose 1995 doctoral work and subsequent textbook An Introduction to MultiAgent Systems became the canonical reference for the field's formal foundations. His specific contribution to MAS was formalizing the BDI (Belief-Desire-Intention) agent architecture — a logical framework for modeling rational agents with explicit mental states — which underpins much of modern agentic AI design. Surprisingly, Wooldridge was also a founding editor of the journal Autonomous Agents and Multi-Agent Systems and has written popular science books on AI aimed at general audiences, reflecting his unusual combination of rigorous formalism and public communication.

researcher · Yoav Shoham | b. 1956 | Game Theory and Agent-Based Economics

Shoham is a Stanford computer scientist who pioneered the application of game-theoretic reasoning to multi-agent systems, co-authoring the landmark textbook Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations with Kevin Leyton-Brown. His work established the bridge between classical economics (mechanism design, Nash equilibria) and AI agent coordination, directly influencing how modern RL-based MAS systems are designed. Less well known is his co-founding of Koios Inc. and his early advocacy for "agent-oriented programming" in the 1990s — a paradigm he argued would eventually supplant object-oriented programming as the dominant software abstraction.

Figure
Multi-Agent System Architecture
LLM-Based Multi-Agent Communication Graph Orchestrator Agent (Planner / Router) Retriever Agent (RAG / Vector Search) Executor Agent (Tool / Code Runner) Critic Agent (Verifier / Scorer) Shared Memory / Message Bus Task dispatch Result return
Figure
Agent Decision Loop
Single Agent: Perceive → Plan → Act → Observe Loop Perceive Plan (LLM Reasoning) Act (Tool / Message) Observe feedback / new observation Short/Long-Term Memory

Intuition

The Mental Model

Imagine an emergency room on a busy night. There is a triage nurse (orchestrator) who sees each incoming patient and routes them to specialists: the cardiologist for chest pain, the radiologist who reads the X-ray independently, and the pharmacist who checks drug interactions before anything is prescribed. No single doctor knows everything with perfect reliability — but the system is far more reliable than any individual because errors at one station are caught by another. The triage nurse doesn't need to understand cardiology deeply; they need to know who to ask and how to verify the answer. Multi-agent AI systems work exactly this way: the orchestrating agent's most important skill is task decomposition and verification routing, not domain expertise. The "patient" is your complex input query; the "diagnosis" is the final answer; and the communication protocol between staff is your message-passing schema. Just as a hospital can fail catastrophically if the triage nurse routes a patient to the wrong ward based on bad initial information, a MAS fails when the orchestrator's decomposition is wrong and downstream agents execute flawlessly on the wrong sub-task.

Historical Development

Origins · 1 minhow this was discovered
History
1986
Minsky's Society of Mind proposes that human intelligence itself emerges from many interacting simple "agents" — an early conceptual foundation for MAS.
1987
The first formal Distributed AI workshops (DAI) establish agent communication, negotiation, and distributed problem solving as legitimate research areas.
1993
Wooldridge & Jennings publish "Intelligent Agents: Theory and Practice," formalizing the BDI (Belief-Desire-Intention) model and giving MAS a rigorous logical underpinning.
1994
FIPA (Foundation for Intelligent Physical Agents) founded to create interoperability standards for agent communication languages (ACL), influencing later API-based agent protocols.
2003
Shoham & Leyton-Brown's game-theoretic MAS framework connects Nash equilibria, mechanism design, and auctions to multi-agent coordination — enabling algorithmic economics.
2016
OpenAI and DeepMind demonstrate cooperative and competitive multi-agent RL at scale — OpenAI's hide-and-seek agents develop emergent tool use; AlphaGo's self-play is an implicit two-agent system.
2022
AutoGPT (Significant Gravitas) and BabyAGI (Nakajima) popularize LLM-based autonomous agent loops, triggering widespread practitioner experimentation with task-spawning agent chains.
2023
Microsoft Research releases AutoGen and MetaGPT frameworks appear, providing structured orchestration primitives (GroupChat, role-playing) for LLM multi-agent pipelines.
2024
Anthropic publishes research on multi-agent "computer use" and OpenAI releases Assistants API with built-in tool use, establishing production-grade MAS infrastructure for practitioners.

Why It Matters

Real-World Impact
AlphaStar (DeepMind, 2019)Used a league of self-playing StarCraft II agents — each a specialist trained against a population of opponents — to achieve Grandmaster level; no single agent policy sufficed without the multi-agent training regime.
ChatGPT Plugins / GPT-4 with ToolsImplements a two-agent pattern where a "router" LLM decides which tool (browser, code interpreter, DALL-E) to invoke, and a "synthesizer" LLM composes the final answer from tool outputs — the simplest commercially deployed MAS.
AutoGen (Microsoft Research)An open-source framework enabling arbitrary graphs of GPT-4 agents with programmable conversation patterns; used in production for automated code review pipelines where a Coder agent writes Python and a Tester agent runs pytest and returns failures.
Voyager (NVIDIA, 2023)A Minecraft-playing LLM agent system with three interacting modules — a curriculum agent that sets tasks, a skill library agent that stores reusable code skills, and an action agent that executes — demonstrating that decomposed LLM agents acquire skills faster than monolithic agents.
Multi-Agent Reinforcement Learning in Robotics (Boston Dynamics / CMU)Fleets of robotic agents use decentralized MARL policies to coordinate warehouse navigation, with each robot observing only its local sensor data but jointly optimizing throughput — a direct application of Equation [3].
Mixture-of-Experts (MoE) as Implicit MASGPT-4 and Mixtral use MoE architectures where each "expert" feedforward network is analogous to a specialized sub-agent; the gating network is the orchestrator. This makes MoE a MAS embedded inside a single forward pass.
Financial Algorithmic TradingHedge funds deploy ensembles of specialized trading agents (momentum agent, mean-reversion agent, news-sentiment agent) whose position recommendations are aggregated by a risk-management meta-agent — a MAS running at microsecond timescales.

Prerequisites

What This Leads To

See Also

Reinforcement Learning · Large Language Models · Retrieval-Augmented Generation · AI Tool Use and Function Calling · Emergent Communication · Mixture of Experts · Agentic AI Pipelines

Before this