{'fraction_non_alphanumeric': 0.022417153996101363, 'fraction_numerical': 0.0, 'mean_word_length': 5.186746987951807, '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}}
Advantages Of Using Memetic Algorithms In The N-Person Iterated Prisoner's Dilemma Game

Memetic algorithms are a type of genetic algorithms very valuable in optimization problems. They are based on the concept of “meme”, and use local search techniques, which allow them to avoid premature convergence to suboptimal solutions. Among these algorithms we can consider Lamarckian and Baldwinian models, depending on whether they modify (the former) or not (the latter) the agent’s genotype. In this paper we analyze the application of memetic algorithms to the NPerson Iterated Prisoner’s Dilemma (NIPD). NIPD is an interesting game that has proved to be very useful to explore the emergence of cooperation in multi-player scenarios. The main contributions of this paper are related to setting the ground to understand the implications of the memetic model and the related parameters. We investigate to which extent these decisions determine the level of cooperation obtained as well as the memory and the execution performance.