A fictitious play approach to large-scale optimization

Operations Research

Volumn 53, Issue 3, 2005, Pages 477-489

  Lambert III, Theodore J ^a   Epelman, Marina A ^b   Smith, Robert L ^b  

^a Truckee Meadows Community College   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Games group decisions: noncooperative; Programming: algorithms heuristic; Transportation: route choice

Indexed keywords

FICTITIOUS PLAY; GAMES/GROUP DECISIONS: COORPERATIVES; PROGRAMMING: ALGORITHMS/HEURISTIC; TRANSPORTATION: ROUTE CHOICE;

COMPUTER SIMULATION; ERROR ANALYSIS; FUNCTIONS; GAME THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

ALGORITHMS;

EID: 25144444833     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1040.0178     Document Type: Review

References (21)

1. Bazaraa, M. S., H. D. Sherali, C. M. Shetty. 1993. Nonlinear Programming: Theory and Algorithms. John Wiley and Sons, New York.
2. Brown, G. W. 1951. Iterative solution of games by fictitious play. Activity Analysis of Production and Allocation. Wiley, New York.
3. Chabini, I. 1998. Discrete dynamic shortest-path problems in transportation applications: Complexity and algorithms with optimal run time. Transportation Res. Record 1645 170-175.
4. Garcia, A., D. Reaume, R. L. Smith. 2000. Fictitious play for finding system optimal routings in dynamic traffic networks. Transportation Res. B 34 146-157.
5. Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA.
6. Harsanyi, J. C. 1973. Oddness of the number of equilibrium points: A new proof. Internat. J. Game Theory 2 235-250.
7. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI.
8. Jong, K. A. D. 1975. An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, University of Michigan, Ann Arbor, MI.
9. Kaufman, D. E., R. L. Smith. 1993. Fastest paths in time-dependent networks for intelligent vehicle-highway systems application. IVHS J. 1 1-11.
10. Kaufman, D. E., R. L. Smith, K. Wunderlich. 1998. Dynamic user-equilibrium properties of fixed-points in iterative routing-assignment methods. Transportation Res. C 6 1-16.
11. Kirkpatrick, S., C. D. Gelatt Jr., M. P. Vecchi. 1983. Optimization by simulated annealing. Science 20 671-680.
12. Lambert, T. J. 2002. Deterministic and stochastic systems optimization. Ph.D. thesis, University of Michigan, Ann Arbor, MI.
13. Lambert, T. J., H. Wang. 2003. Fictitious play approach to a mobile unit situation awareness problem. Technical report, University of Michigan, Ann Arbor, MI.
14. Monderer, D., L. Shapley. 1996. Fictitious play property for games with identical interests. J. Econom. Theory 68 258-265.
15. Munkres, J. R. 1975. Topology: A First Course. Prentice-Hall, Englewood Cliffs, NJ.
16. Potts, R. B., R. M. Oliver. 1972. Flows in Transportation Networks. Academic Press, New York.
17. Robinson, J. 1951. An iterative method of solving a game. Ann. Math. 54 296-301.
18. Rosenmüller, J. 1971. On a generalization of the Lemke-Howson algorithm to noncooperative N-person games. SIAM J. Appl. Math. 21 73-79.
19. Ross, S. M. 1996. Stochastic Processes. John Wiley and Sons, New York.
20. Stark, W. E., H. Wang, A. Worthen, S. Lafortune, D. Teneketzis. 2002. Low-energy wireless communication network design. IEEE Wireless Comm. 9 60-72.
21. Wilson, R. 1971. Computing equilibria of N-person game. SIAM J. Appl. Math. 21 80-87.