Using Genetic Algorithms to Breed Competitive Marketing Strategies



1998 IEEE International Conference on Systems, Man, and Cybernetics
La Jolla, California, USA
October 11-14, 1998
Intelligent Systems for Humans in a Cyberworld

G. M. Shiraz
Dept. of Artificial Intelligence
University of New South Wales
Sydney NSW 2052
Australia
hossein@cse.unsw.edu.au

Robert E. Marks
Australian Graduate School of Management
University of New South Wales
Sydney NSW 2052
Australia
bobm@agsm.edu.au

David F. Midgley
Australian Graduate School of Management
University of New South Wales
Sydney NSW 2052
Australia
davidm@agsm.edu.au

Lee G. Cooper
Anderson Graduate School of Management
University of California Los Angeles
Los Angeles CA 90095
USA
lcooper@agsm.ucla.edu





ABSTRACT

Genetic algorithms (GAs) have been used extensively in engineering and computer science to optimize specific functions, especially those which exhibit non-convexities and so are not amenable to calculus-based methods of optimization. A parallel use of GAs has been to solve algorithmic problems. A third domain in which GAs have been used is that of searching for mappings which optimize a repeated procedure. An offshoot of this has been their use in what has been called co-evolution of mappings. This paper reports results from a project in which GAs have been used to, first, to derive mappings which may explain the behavior of brand managers in an oligopolistic retail market for coffee, and, second, to attempt to improve on the historical profits of these brand managers, pitted in weekly competition with each other, vying for sales and profits with their different brands of ground, sealed coffee on the supermarket shelves. As well as advancing the practice of GAs, with separate populations competing, the work also advances our understanding of modeling players in repeated oligopolistic interactions, or games.

Text of the paper in Acrobat PDF 3.0 format


bobm@agsm.edu.au
Last altered on June 15, 1998