The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
PeerTrust: Supporting Reputation-Based Trust for Peer-to-Peer Electronic Communities
IEEE Transactions on Knowledge and Data Engineering
Reputation Mechanism Design in Online Trading Environments with Pure Moral Hazard
Information Systems Research
Trust on the world wide web: a survey
Foundations and Trends in Web Science
On honesty in sovereign information sharing
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Effective Usage of Computational Trust Models in Rational Environments
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Hi-index | 0.00 |
Reputation-based trust models using statistical learning have been intensively studied for distributed systems where peers behave maliciously. However practical applications of such models in environments with both malicious and rational behaviors are still very little understood. This paper studies the relation between accuracy of a computational trust model and its ability to effectively enforce cooperation among rational agents. We provide theoretical results showing under which conditions cooperation emerges when using a trust learning algorithms with given accuracy and how cooperation can be still sustained while reducing cost and accuracy of those algorithms. We then verify and extend these theoretical results to a variety of settings involving honest, malicious and strategic players through extensive simulation. These results will enable a much more targeted, cost-effective and realistic design for decentralized trust management systems, such as needed for peer-to-peer systems and electronic commerce.