Payoff Performance of Fictitious Play
Not on the map. Why?
Abstract (arXiv)
We investigate how well continuous-time fictitious play in two-player games performs in terms of average payoff, particularly compared to Nash equilibrium payoff. We show that in many games, fictitious play outperforms Nash equilibrium on average or even at all times, and moreover that any game is linearly equivalent to one in which this is the case. Conversely, we provide conditions under which Nash equilibrium payoff dominates fictitious play payoff. A key step in our analysis is to show that fictitious play dynamics asymptotically converges the set of coarse correlated equilibria (a fact which is implicit in the literature).
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Aug 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2025Learnable Mixed Nash Equilibria are Collectively Rational16 Oct 2025
- 2023Asymptotic Convergence and Performance of Multi-Agent Q-Learning Dynamics23 Jan 2023
- 2022Learning Correlated Equilibria in Mean-Field Games22 Aug 2022
- 2022On the Convergence of Fictitious Play: A Decomposition Approach3 May 2022