Skip to main navigation Skip to search Skip to main content

Fictitious Play Algorithm

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

The original fictitious play algorithm is an iterative procedure developed by G. Brown to find an estimate of a solution to two-person zero-sum games (also commonly referred to as matrix games). The simplicity of the method is very appealing, but the convergence is very slow. Since its development, most of the ensuing research had focused on modifications to speed up convergence rate, identifying other classes of games where the method (or its variants) converges or fails to converge, and implementing the fictitious play concept in solving some applied problems. A complete description of the algorithm is provided, along with an example where a detailed step-by-step execution of the first few iterations is illustrated.

Original languageEnglish
Title of host publicationWiley Encyclopedia of Operations Research and Management Science
Publisherwiley
Pages1-8
Number of pages8
ISBN (Electronic)9780470400531
ISBN (Print)9780470400630
DOIs
StatePublished - 1 Jan 2010

Keywords

  • fictitious play
  • learning process
  • matrix games
  • symmetric games
  • two-person zero-sum games

Fingerprint

Dive into the research topics of 'Fictitious Play Algorithm'. Together they form a unique fingerprint.

Cite this