Coevolution of finite automata with errors
AbstractErrors are common in strategic situations. We use a genetic algorithm to simulate the evolution of error-prone finite automata in the repeated Prisoner's Dilemma game. In particular, the automata are subjected to implementation and perception errors. The computational experiments assess whether and how the distribution of outcomes and structures in the population changes with different levels of errors. We find that the complexity of the automata is decreasing in the probability of errors. Furthermore, the prevailing structures tend to exhibit low reciprocal cooperation and low tolerance to defections as the probability of errors increases. In addition, by varying the error-level, the study identifies a threshold error-level. At and above the threshold error-level, the prevailing structures converge to the open-loop (history-independent) automaton Always-Defect. On the other hand, below the threshold, the prevailing structures are closed-loop (history-dependent) and diverse, which impedes any inferential projections on the superiority of a particular machine. Keywords; automata, repeated games, prisoner's dilemma, genetic algorithms, local polynomial regression
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Economics Division, School of Social Sciences, University of Southampton in its series Discussion Paper Series In Economics And Econometrics with number 1019.
Date of creation: 17 Jan 2013
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-12-23 (All new papers)
- NEP-CBE-2010-12-23 (Cognitive & Behavioural Economics)
- NEP-CMP-2010-12-23 (Computational Economics)
- NEP-EVO-2010-12-23 (Evolutionary Economics)
- NEP-EXP-2010-12-23 (Experimental Economics)
- NEP-GTH-2010-12-23 (Game Theory)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statistics
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Chris Thorn).
If references are entirely missing, you can add them using this form.