Communications of the ACM
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Managing trust in a peer-2-peer information system
Proceedings of the tenth international conference on Information and knowledge management
Performance analysis of the CONFIDANT protocol
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Reputation and social network analysis in multi-agent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Incentives for Sharing in Peer-to-Peer Networks
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Detecting deception in reputation management
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
Comparing economic incentives in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Modelling incentives for collaboration in mobile ad hoc networks
Performance Evaluation - Selected papers from the first workshop on modeling and optimization in mobile, ad hoc and wireless networks (WiOpt'2003)
Review on Computational Trust and Reputation Models
Artificial Intelligence Review
Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Selfish Routing and the Price of Anarchy
Selfish Routing and the Price of Anarchy
Pricing Communication Networks: Economics, Technology and Modelling (Wiley Interscience Series in Systems and Optimization)
Eliciting Informative Feedback: The Peer-Prediction Method
Management Science
Automated response using system-call delays
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Self-policing mobile ad hoc networks by reputation systems
IEEE Communications Magazine
Self-organised virtual communities: bridging the gap between web-based communities and P2P systems
International Journal of Web Based Communities
Study on trust inference and emergence of economical small-world phenomena in P2P environment
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
A reputation system for wireless mesh networks using network coding
Journal of Network and Computer Applications
Bringing knowledge into recommender systems
Journal of Systems and Software
| Hi-index | 0.00 |
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 behaviour). 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.