2002 · 13 citations · 3 references
Open access
ComputingComputer ScienceAlgorithmsDynamical SystemsGame TheoryAgent-based SimulationAutomata TheoryEvolutionary ComputationEvolutionary Game TheoryGenetic AlgorithmsMulti-agent SystemsAgent SimulationsComputational Game TheoryEvolutionary Multi-agent SystemsGame-theoretic EvolutionGame-theoretic Multi-agent SystemsPrisoner’s Dilemma
This paper presents the use of automata with multiplicities for the modelization of agent behaviours. Genetic algorithms can be defined on their probabilistic forms and are able to simulate adaptive behaviours. An application to a simulation of evolutive strategies in game theory is presented, specifi-cally for the prisoner dilemma which is considered as a basic model of dynamic agents interactions in terms of cooperation and competition.
3
Robert Axelrod, W D Hamilton · Science · 1981 · 20.3K citations
Hidden Order: How Adaptation Builds Complexity
Roger F. Malina, John H. Holland · Leonardo · 1996 · 2.5K citations
On the definition of a family of automata
M. P. Schützenberger · Information and Control · 1961 · 645 citations