Reputation in Self-Organized Communication Systems and Beyond (Invited Paper)

Efficiently handling reputation is important in dealing with free-riding, malicious attacks and random failures in self-organized communication systems. At the same time, work in this context is often found to be relevant in many other disciplines, in particular the social sciences. A number of distributed reputation systems have been proposed and analyzed, although research has not been very coherent. In this paper, for the first time, we provide an overview of the state-of-the-art in the various computer science communities as well as the social sciences. In particular, we present results obtained from our mathematical model devised to investigate the impact of liars on their peers' reputation about a subject. We find that liars have no impact unless their number exceeds a certain threshold (phase transition). We give precise formulae and quantify the impact, thereby providing insight into fundamental questions in social networks as well as facilitating performance evaluation and optimization of distributed reputation systems in communication networks. We conclude by suggesting fundamental directions for future research into reputation.

Published in:
interperf '06: Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems, 200
Presented at:
Workshop on Interdisciplinary Systems Approach in Performance Evaluation and Design of Computer & Communications Systems (Inter-Perf'06), Pisa, Italy, October 2006
New York, USA, ACM

Note: The status of this file is: Anyone

 Record created 2006-08-11, last modified 2020-10-28

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)