Standard Article

Fictitious Play Algorithm

  1. Pablo Zafra

Published Online: 14 JAN 2011

DOI: 10.1002/9780470400531.eorms0322

Wiley Encyclopedia of Operations Research and Management Science

Wiley Encyclopedia of Operations Research and Management Science

How to Cite

Zafra, P. 2011. Fictitious Play Algorithm. Wiley Encyclopedia of Operations Research and Management Science. .

Author Information

  1. Kean University, Union, Department of Mathematics, New Jersey

Publication History

  1. Published Online: 14 JAN 2011

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.

Keywords:

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