{'fraction_non_alphanumeric': 0.01901743264659271, 'fraction_numerical': 0.000792393026941363, 'mean_word_length': 4.985781990521327, '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}}
Analysis of a robust reputation system for self-organised networks

Self-organized networks require some mechanism to ensure cooperation and fairness in the face of individual utility maximizing users and potential malicious attacks. Otherwise, network performance can be seriously deteriorated. One promising approach are decentralized reputation systems. However, these are vulnerable to users with an interest in passing on false information. Robustness against liars has not yet been analyzed in detail. In this paper, we provide a first step to the robustness analysis of a reputation system based on the deviation test as introduced in [6]. Users accept second hand information only if this does not differ too much from their reputation values. We show that the system exhibits a phase transition: In the subcritical regime, the reputation system is robust and the lying has no effect. In the supercritical regime, the lying does have an impact. We obtain the exact critical values via a mean field approach. We then use explicit computation to verify the mean field results. Thus, we can give conditions under which the deviation test makes the reputation system robust. We also obtain quantitative results on what goes wrong in the supercritical regime.