Skip to main content
  • 353 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dawid, H. (1999). Conclusions. In: Adaptive Learning by Genetic Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18142-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18142-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62106-2

  • Online ISBN: 978-3-642-18142-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics