{'fraction_non_alphanumeric': 0.02214022140221402, 'fraction_numerical': 0.0, 'mean_word_length': 5.575757575757576, '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}}
The Role of Probability of Learning and Reconnecting in the Evolution of Cooperation

Cooperative phenomenon is widely researched within the fields of computational genomics, artificial intelligence, machine learning and data mining technologies. A key idea behind complex system constructed by intelligent agents is to establish cooperation between different agents so as to solve problems more effectively and efficiently than a single agent can do. Understanding the evolutionary mechanisms that promote and maintain cooperative behavior is recognized as a major theoretical problem where the intricacy increases with the complexity of the participating individuals. We presents current research on the effect of the "probability of learning" (Pl) and the "probability of reconnecting" (Pr) in NIPD game in evolution experiment based on complex network system, static and dynamic. We show that the "probability of learning" (Pl) is not the decisive factor on static network but it plays an important role on dynamic network where the "probability of reconnecting" (Pr) is not zero.