A Fictitious Play Approach to Large-Scale Optimization

Theodore J. Lambert (), Marina A. Epelman () and Robert L. Smith ()
Additional contact information
Theodore J. Lambert: Mathematics Department, Truckee Meadows Community College, 7000 Dandini Boulevard, Vista B200, Reno, Nevada 89512
Marina A. Epelman: Department of Industrial and Operations Engineering, University of Michigan, 1205 Beal Avenue, Ann Arbor, Michigan 48109
Robert L. Smith: Department of Industrial and Operations Engineering, University of Michigan, 1205 Beal Avenue, Ann Arbor, Michigan 48109

Operations Research, 2005, vol. 53, issue 3, 477-489

Abstract: In this paper, we investigate the properties of the sampled version of the fictitious play algorithm, familiar from game theory, for games with identical payoffs, and propose a heuristic based on fictitious play as a solution procedure for discrete optimization problems of the form max{ u ( y ): y = ( y 1 ,…, y n ) ∈ (Y-script) 1 ×⋯×(Y-script) n }, i.e., in which the feasible region is a Cartesian product of finite sets (Y-script) i , i ∈ N = {1,…, n }. The contributions of this paper are twofold. In the first part of the paper, we broaden the existing results on convergence properties of the fictitious play algorithm on games with identical payoffs to include an approximate fictitious play algorithm that allows for errors in players’ best replies. Moreover, we introduce sampling-based approximate fictitious play that possesses the above convergence properties, and at the same time provides a computationally efficient method for implementing fictitious play. In the second part of the paper, we motivate the use of algorithms based on sampled fictitious play to solve optimization problems in the above form with particular focus on the problems in which the objective function u (·) comes from a “black box,” such as a simulation model, where significant computational effort is required for each function evaluation.

Keywords: games/group decisions:noncooperative; programming:algorithms/heuristic; transportation:route choice (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1040.0178 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:53:y:2005:i:3:p:477-489

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().