Abstract
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.
Similar content being viewed by others
References
Arthur WB (1994) Inductive reasoning and bounded rationality. Am Econ Rev 84:406–411 (Papers and Proceedings)
Austin JL (1975) How to do things with words. Harward University Press, Cambridge
Axelrod R (1997) The complexity of cooperation. Princeton University Press, Chichester
Bratman ME (1987) Intentions, plans and reason. Harvard University Press, Cambridge
Chisholm R (1964) The descriptive element in the concept of action. J Philos 61(20):613–625
Camerer C Teck-Hua H (1999) Experience weighted attraction learning in normal-form games. Econometrica 67(4):827–874
Davidson D (1980) Essays on action and events. Oxford University Press, Oxford
Davidson D, Harman G (eds) (1973) Semantics of natural languages, 2nd edn. Springer, Berlin
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
Gardner M (1970) The fantastic combinations of John Conway’s new solitaire game life. Sci Am 223:120–123
Gardner M (1971) On cellular automata, self-reproduction, the Garden of Eden and the game life. Sci Am 224:112–117
Goldman A (1971) The individuation of action. J Philos 68(21):761–774
Harley CB (1981) Learning in evolutionary stable strategy. J Theor Biol 89:611–633
Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor. Reprinted (1992) MIT, Cambridge
Koza JR (1990) Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems. Technical report, Computer Science Department, Stanford University
Mele A (ed) (1997) The philosophy of action. Oxford University Press, Oxford
Nagel K, Schreckenberg M (1992) A cellular automaton model for freeway traffic. J Phys I 2:2221–2229 France
Pitz T (2000) Anwendung genetischer Algorithmen auf Handlungsbaume in Multiagentensystemen zur Simulation sozialen Handelns, Frankfurt am Main
Pitz T, Chmura T (2005) Genetic action trees. Working paper, EconWPA
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
Searle JR (1971) The philosophy of language. Oxford University Press, London
Searle JR (1983) Intentionality. Cambridge University Press, Cambridge
Schelling TC (1969) Models of segregation. Am Econ Rev 59:488–493
Schelling TC (1971) Dynamic models of segregation. J Math Sociol 1:143–186
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
von Neumann J (1996) The theory of self-reproducing automata, Burks A W. (ed). University of Illinois, Urbana
Weiss G (1999) Multi-agent systems. MIT, Cambridge
Wilensky U (1997) NetLogo party model. Center for Connected Learning and Computer-Based Modeling, Northwestern University, Evanston, IL. http://ccl.northwestern.edu/netlogo/models/Party
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chmura, T., Kaiser, J. & Pitz, T. Simulating complex social behaviour with the genetic action tree kernel. Comput Math Organiz Theor 13, 355–377 (2007). https://doi.org/10.1007/s10588-007-9016-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10588-007-9016-9