Off-Line Computation of Stackelberg Solutions with the Genetic Algorithm
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. Citation Copyright 1999 by Kluwer Academic Publishers.
Volume (Year): 13 (1999)
Issue (Month): 3 (June)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=100248|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:kap:compec:v:13:y:1999:i:3:p:201-09. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.