IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-18142-9_8.html
   My bibliography  Save this book chapter

Conclusions

In: Adaptive Learning by Genetic Algorithms

Author

Listed:
  • Herbert Dawid

    (University of Vienna, Department of Management Science)

Abstract

These notes are intended to contribute to the growing field of research dealing with the use of AI and CI techniques in economics. I have shortly summarized some of the most important contributions of the recent years and have afterwards concentrated on a thorough analysis of a special CI technique, namely genetic algorithms. It was argued that GAs, due to their decentralized structure which very naturally resembles to a group of economic agents and their interactions, are especially well-suited to simulate the behavior of an economic system. Further an interpretation in a behavioral sense of the single operators contained in a genetic algorithm was suggested, but also the problems with the economic interpretation of certain aspects of the algorithm were pointed out. The fact that in economic setups the fitness of a single string depends on the current state of the whole population has led to the conclusion that the analytical models which describe the behavior of a genetic algorithm used to solve an optimization problem can not be applied in most economic systems. Perhaps the main results are several propositions describing the limit behavior of a genetic algorithm in systems where the fitness function is state dependent. These theoretical results, but of course also the learning ability of a GA as such, have been illustrated afterwards with several examples from the field of game theory and economics. The simulations showed that mathematical reasoning enables us not only to understand but also to predict the behavior of GAs in economic systems. However these examples made also clear that a local analysis like the one done in chapter 4 is in many cases not able to explain the complete behavior of the system. In several cases heuristic explanations for a certain kind of behavior had to be given instead of a rigorous mathematical analysis. We have to face the fact that the current knowledge about high-dimensional non-linear difference equations does not enable us to describe the global behavior of such a system. Nevertheless, I am confident that the application of special theories like the graph theoretical approach taken here in proposition 4.2.1 or the theory of nonlinear dynamical systems will permit further mathematical insights into the behavior of GAs in SDF systems.

Suggested Citation

  • Herbert Dawid, 1999. "Conclusions," Springer Books, in: Adaptive Learning by Genetic Algorithms, edition 0, chapter 8, pages 169-170, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-18142-9_8
    DOI: 10.1007/978-3-642-18142-9_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-18142-9_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.