Pith. sign in

REVIEW 1 cited by

Payoff Performance of Fictitious Play

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1308.4049 v2 pith:PSA53IVS submitted 2013-08-19 cs.GT math.DS

classification cs.GTmath.DS
keywords fictitiouspayoffplayequilibriumnashaveragegamesanalysis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learnable Mixed Nash Equilibria are Collectively Rational

    cs.GT 2025-10 reject novelty 7.0 of 10

    A mixed Nash equilibrium that is locally uniformly stable under uncoupled learning dynamics must be weakly Pareto optimal, and uniform stability controls last-iterate convergence of smoothed best-response dynamics.

Pith tools