Unified convergence proofs of continuous-time fictitious play

Jeff S. Shamma*, Gurdal Arslan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

Abstract

We consider a continuous-time version of fictitious play (FP), in which interacting players evolve their strategies in reaction to their opponents' actions without knowledge of their opponents' utilities. It is known that FP need not converge, but that convergence is possible in certain special cases including zero-sum games, identical interest games, and two-player/two-move games. We provide a unified proof of convergence in all of these cases by showing that a Lyapunov function previously introduced for zero-sum games also can establish stability in the other special cases. We go on to consider a two-player game in which only one player has two-moves and use properties of planar dynamical systems to establish convergence.

Original languageEnglish (US)
Pages (from-to)1137-1142
Number of pages6
JournalIEEE Transactions on Automatic Control
Volume49
Issue number7
DOIs
StatePublished - Jul 1 2004

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Unified convergence proofs of continuous-time fictitious play'. Together they form a unique fingerprint.

Cite this