RESUMO
We study a population of individuals playing the infinitely repeated prisoner's dilemma under replicator dynamics. The population consists of three kinds of individuals adopting the following reactive strategies: ALLD (individuals which always defect), ATFT (almost tit-for-tat: individuals which almost always repeat the opponent's last move) and G (generous individuals, which always cooperate when the opponent cooperated in the last move and have a positive probability q of cooperating when their opponent has defected). Our aim is studying in a mathematically rigorous fashion the dynamics of a simplified version for the computer experiment in Nowak and Sigmund (Nature 355:250-253, 1992) involving 100 reactive strategies. We see that as the generosity degree of the G individuals varies, equilibria (rest points) of the dynamics appear or disappear, and the dynamics changes accordingly. Not only we prove that the results of the experiment are true in our simplified version, but we also have complete control on the existence or non-existence of the equilbria for the dynamics for all possible values of the parameters, given that ATFT individuals are close enough to TFT. For most values of the parameters the dynamics can be completely determined.