• repeated games
• folk theorem
• genetic algorithm
• prisoner's dilemma

We present a survey of some the main applications of the folk theorem, a central result of the theory of repeated games proves that cooperative outcomes can be obtained in non-cooperative repeated games, to a variety of settings differing for the type of interaction between players. However, the folk theorem fails to provide practical tools for predicting the outcome of specific games. Computer simulation is one of the means by which the theory can be complemented. In this thesis, we applied the genetic algorithm to the analysis of four different tournaments of the repeated prisoner's dilemma.