Game theory

Fictitious Play

A learning process in which players best-respond to the empirical distribution of past opponent play.

Ask the Game theory assistant 1 min read · Updated September 9, 2026

Definition

At each round tt, player ii forms beliefs σ^−it\hat\sigma_{-i}^t as the empirical frequency of opponents' past actions and best-responds: sit∈arg⁡max⁡siui(si,σ^−it)s_i^t\in\arg\max_{s_i} u_i(s_i,\hat\sigma_{-i}^t).

Convergence in beliefs need not imply convergence in actions: the path can cycle.

Intuition

Players track what opponents have done historically and choose the action that would have been best against that history.

It captures a simple form of experiential learning without Bayesian updating.

Worked example

Fictitious play converges to Nash in zero-sum games (Robinson 1951), potential games (Monderer-Shapley), and 2×22\times 2 games with strategic complements.

In Rock-Paper-Scissors, fictitious play cycles without converging.

The math

Brown (1951): originally proposed as a method to compute the value of zero-sum games.

Fictitious play is a best-response dynamic; smooth fictitious play replaces argmax with stochastic choice (QRE-like).

Where it is used

Algorithmic game theory (computing equilibria), multi-agent learning, and economic modeling of boundedly rational learning.

Connects to reinforcement learning and regret minimization.

More in Game theory

Assembled from the ReLU.chat curated knowledge base. These explanations are concise on purpose; check the sources for anything important.