Competitive recommendation systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
KeyNote: Trust Management for Public-Key Infrastructures (Position Paper)
Proceedings of the 6th International Workshop on Security Protocols
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Recommendation Systems: A Probabilistic Analysis
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Computational Model of Trust and Reputation for E-businesses
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 7 - Volume 7
Collaboration of untrusting peers with changing interests
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Using mixture models for collaborative filtering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Improved recommendation systems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Collaborate with strangers to find own preferences
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Enforcing collaboration in peer-to-peer routing services
iTrust'03 Proceedings of the 1st international conference on Trust management
Decentralized trust management
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Competitive collaborative learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
A probabilistic trust model for handling inaccurate reputation sources
iTrust'05 Proceedings of the Third international conference on Trust Management
| Hi-index | 0.02 |
Many reputation systems mainly concentrate on avoiding untrustworthy agents by communicating reputation. Here arises the problem that when an agent does not know another agent very much then there is no way to notice such ambiguity. This paper shows a new protocol in which an agent can notice that ambiguity using the notion of statistics, and illustrates the facility of designing agents' algorithms as well as existing reputation systems.