Breeding Hybrid Strategies: Optimal Behaviour for Oligopolists
Oligopolistic pricing decisions--in which the choice variable is not dichotomous, as in the simple prisoner's dilemma, but continuous--have been modeled as a generalized prisoner's dilemma (GPD) by Fader and Hauser, who sought, in the two MIT Computer Strategy Tournaments, to obtain an effective generalization of Rapoport's Tit for Tat for the three-person repeated game. Holland's genetic algorithm and Axelrod's representation of contingent strategies provide a means of generating new strategies in the computer, through machine learning, without outside submissions. This paper discusses how findings from two-person tournaments can be extended to the GPD, in particular how the author's winning strategy in the Second MIT Competitive Strategy Tournament could be bettered. The paper provides insight into how oligopolistic pricing competitors can successfully compete, and underlines the importance of "niche" strategies, successful against a particular environment of competitors.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 2 (1992)
Issue (Month): 1 (March)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00191/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joevec:v:2:y:1992:i:1:p:17-38. 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.