Fig. 3From: Oyun: A New, Free Program for Iterated Prisoner's Dilemma Tournaments in the ClassroomExample results taking the same strategies from Fig. 2 and placing them in a 200-generation evolutionary tournament. The host is the lowest (worst-performing) line on the graph, only slightly outcompeted by the random strategy. We see the parasite (top line at left) initially perform very well, but eventually be outcompeted by Tit-for-Tat (the center line) around generation 145Back to article page