Simulating complex social behaviour with the genetic action tree kernel

  • Thorsten Chmura
  • Johannes Kaiser
  • Thomas Pitz


The concept of genetic action trees combines action trees with genetic algorithms. In this paper, we create a multi-agent simulation on the base of this concept and provide the interested reader with a software package to apply genetic action trees in a multi-agent simulation to simulate complex social behaviour. An example model is introduced to conduct a feasibility study with the described method. We find that our library can be used to simulate the behaviour of agents in a complex setting and observe a convergence to a global optimum in spite of the absence of stable states.


Multi-agent system Genetic algorithm Action trees Social simulation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Arthur WB (1994) Inductive reasoning and bounded rationality. Am Econ Rev 84:406–411 (Papers and Proceedings) Google Scholar
  2. Austin JL (1975) How to do things with words. Harward University Press, Cambridge Google Scholar
  3. Axelrod R (1997) The complexity of cooperation. Princeton University Press, Chichester Google Scholar
  4. Bratman ME (1987) Intentions, plans and reason. Harvard University Press, Cambridge Google Scholar
  5. Chisholm R (1964) The descriptive element in the concept of action. J Philos 61(20):613–625 CrossRefGoogle Scholar
  6. Camerer C Teck-Hua H (1999) Experience weighted attraction learning in normal-form games. Econometrica 67(4):827–874 CrossRefGoogle Scholar
  7. Davidson D (1980) Essays on action and events. Oxford University Press, Oxford Google Scholar
  8. Davidson D, Harman G (eds) (1973) Semantics of natural languages, 2nd edn. Springer, Berlin Google Scholar
  9. Erev I, Roth AE (1998) Predicting how people play games: reinforcement learning in experimental games with unique, mixed strategy equilibria. Am Econ Rev 88(4):848–881 Google Scholar
  10. Gardner M (1970) The fantastic combinations of John Conway’s new solitaire game life. Sci Am 223:120–123 CrossRefGoogle Scholar
  11. Gardner M (1971) On cellular automata, self-reproduction, the Garden of Eden and the game life. Sci Am 224:112–117 Google Scholar
  12. Goldman A (1971) The individuation of action. J Philos 68(21):761–774 CrossRefGoogle Scholar
  13. Harley CB (1981) Learning in evolutionary stable strategy. J Theor Biol 89:611–633 CrossRefGoogle Scholar
  14. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor. Reprinted (1992) MIT, Cambridge Google Scholar
  15. Koza JR (1990) Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems. Technical report, Computer Science Department, Stanford University Google Scholar
  16. Mele A (ed) (1997) The philosophy of action. Oxford University Press, Oxford Google Scholar
  17. Nagel K, Schreckenberg M (1992) A cellular automaton model for freeway traffic. J Phys I 2:2221–2229 France CrossRefGoogle Scholar
  18. Pitz T (2000) Anwendung genetischer Algorithmen auf Handlungsbaume in Multiagentensystemen zur Simulation sozialen Handelns, Frankfurt am Main Google Scholar
  19. Pitz T, Chmura T (2005) Genetic action trees. Working paper, EconWPA Google Scholar
  20. Roth AE, Erev I (1995) Learning in extensive games: experimental data and simple dynamic models in the intermediate term. Games Econ Behav 8:164–212 CrossRefGoogle Scholar
  21. Searle JR (1971) The philosophy of language. Oxford University Press, London Google Scholar
  22. Searle JR (1983) Intentionality. Cambridge University Press, Cambridge Google Scholar
  23. Schelling TC (1969) Models of segregation. Am Econ Rev 59:488–493 Google Scholar
  24. Schelling TC (1971) Dynamic models of segregation. J Math Sociol 1:143–186 CrossRefGoogle Scholar
  25. Selten R, Pitz T, Chmura T, Schreckenberg M, Wahle J (2003) Experiments on route choice behaviour. In: Emmerich H, Nestler B (eds) Schreckenberg interface and transport dynamics. Lecture notes in computer science, vol 32. Springer, Heidelberg, pp 136–155 Google Scholar
  26. von Neumann J (1996) The theory of self-reproducing automata, Burks A W. (ed). University of Illinois, Urbana Google Scholar
  27. Weiss G (1999) Multi-agent systems. MIT, Cambridge Google Scholar
  28. Wilensky U (1997) NetLogo party model. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL.

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Laboratory for Experimental EconomicsUniversity of BonnBonnGermany
  2. 2.Department of EconomicsShanghai Jiao Tong UniversityShanghaiPeople’s Republic of China

Personalised recommendations