{'fraction_non_alphanumeric': 0.018975332068311195, 'fraction_numerical': 0.007590132827324478, 'mean_word_length': 4.932584269662922, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Evolution and Information in a Prisoner's Dilemma Game

In an environment of anonymous random matching, Kandori [1992] showed that with a sufficiently rich class of simple information systems the folk theorem holds. We specialize to the Prisoner's Dilemma and examine the stochastic stability of a process of learning and evolution in this setting. If the benefit of future cooperation is too small, then there is no cooperation. When the benefit of cooperation is large then only cooperation will survive in the very long run.