Open Access
Subscription Access
The Effect of Segregation in Non-Repeated Prisoner's Dilemma
This article consolidates the idea that non-random pairing can promote the evolution of cooperation in a non-repeated version of the prisoner’s dilemma. This idea is taken from[1], which presents experiments utilizing stochastic simulation. In the following it is shown how the results from [1] is reproducible by numerical analysis. It is also demonstrated that some unexplained findings in [1], is due to the methods used.
Keywords
Evolution, Cooperation, Segregation, Prisoner’s Dilemma.
User
Font Size
Information
- N. B. Jon Reiersen, Matching structure and the evolution of cooperation in the prisoner's dilemma, International journal of computer science & information technology (IJCSIT), vol. 5, pp. 109 119, Aug. 2013.
- R. Axelrod and W. D. Hamilton, The evolution of cooperation, Science, vol. 211, no. 4489, pp. 1390 1396, 1981.
- W. D. Hamilton, The genetical evolution of social behaviour. ii, Journal of theoretical biology, vol. 7, no. 1, pp. 17 52, 1964.
- M. A. Nowak, Five rules for the evolution of cooperation, science, vol. 314, no. 5805, pp. 1560 1563, 2006.
- R. Boyd and P. J. Richerson, The evolution of reciprocity in sizable groups, Journal of theoretical Biology, vol. 132, no. 3, pp. 337 356, 1988.
- D. Thierens and D. Goldberg, Convergence models of genetic algorithm selection schemes, in Parallel Problem Solving from Nature PPSN III (Y. Davidor, H.-P. Schwefel, and R. M nner, eds.), vol. 866 of Lecture Notes in Computer Science, pp. 119 129, Springer Berlin Heidelberg, 1994.
- H. M hlenbein and D. Schlierkamp-Voosen, Predictive models for the breeder genetic algorithm i. continuous parameter optimization, Evolutionary computation, vol. 1, no. 1, pp. 25 49, 1993.
Abstract Views: 398
PDF Views: 169