Off-line computation of Stackelberg solutions with the genetic algorithm

Computational Economics

Volumn 13, Issue 3, 1999, Pages 201-209

  Vallée, Thomas ^a   Başar, Tamer ^b  

^a UNIVERSITÉ DE NANTES   (France)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Genetic algorithm; Off line computation; Stackelberg game

Indexed keywords

EID: 0013116366     PISSN: 09277099     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008652106422     Document Type: Article

References (8)

1. Axelrod, R. (1987). The evolution of strategies in the iterated prisoner's dilemma. In L.D. Davis (ed.), Genetic Algorithms and Simulated Annealing. Morgan Kaufmann.
2. Başar, T. and Olsder, G. (1995). Dynamic Noncooperative Game Theory. 2nd edition, Academic Press, New York.
3. Goldberg, D. (1989). Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley.
4. Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
5. Holland, J.H. (1995). Hidden Order. Addison-Wesley.
6. Levhari, D. and Mirman, L.J. (1980). The great fish war: An example using a dynamic Cournot-Nash solution. Bell Journal of Economics, 11, 322-334.
7. Li, S. and Başar, T. (1987). Distributed algorithms for the computation of noncooperative equilibria. Automatica, 24(4), 523-533.
8. Simaan, M. and Cruz, J. (1973). On the Stackelberg strategy in nonzero-sum games. Journal of Optimization Theory and Applications, 11, 533-555.