AIRCC's International Journal of Computer Science and Information Technology

The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Alternatively, you can download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link above.

Fullscreen Fullscreen Off


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
Notifications
Font Size