{'fraction_non_alphanumeric': 0.017357762777242044, 'fraction_numerical': 0.0028929604628736743, 'mean_word_length': 5.329268292682927, '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}}
Modelling reputation-based resource pooling in P2P systems

P2P systems have a very loose social structure and lack a central authority that enforces cooperative behavior. If peers choose not to contribute but to free ride, detecting and punishing misbehaviour is hard. Several solutions have been proposed that make anti-social behavior less profitable, all with different applications in mind. The two basic categories are payment schemes and reputation mechanisms.In this paper, we propose a new model for P2P systems and use it to analyse the effects of different reputation mechanisms on performance of the application. We identify basic classes of peers, reputation functions, resource distribution strategies, and adversary types, and present simultation results for a few systems composed of these building blocks. Finally, we expose an antagonism between the goal of establishing a distributed data structure with mostly noise-free reputation information and the goal of punishing free riders that all methods will have to face.