Abstract
The paper studies off-line computation of the Stackelberg solution in a repeated game framework, utilizing the Genetic Algorithm. Simulations are conducted with a numerical linear quadratic example and a Fish War game example. Furthermore, it is shown that an evolutionary mutation probability is preferable to a fixed one as usually assumed.
Original language | English (US) |
---|---|
Pages (from-to) | 201-209 |
Number of pages | 9 |
Journal | Computational Economics |
Volume | 13 |
Issue number | 3 |
DOIs | |
State | Published - 1999 |
Keywords
- Genetic algorithm
- Off-line computation
- Stackelberg game
ASJC Scopus subject areas
- Economics, Econometrics and Finance (miscellaneous)
- Computer Science Applications