Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A reputation mechanism for layered communities

A reputation mechanism for layered communities The exchange of digital goods via peer-to-peer (P2P) systems is a challenging problem for e-commerce. Participants rarely know each other, and may be completely anonymous, so the self-interest of the participants works against trust and they miss out on the benefits of cooperation. Reputation mechanisms help to remedy selfish misbehaviour. In this paper a new layered reputation mechanism establishes a trusted P2P environment, with bad content filtered out and novel content continuously introduced, by giving appropriate incentives to participants. A simulation was created and experiments run to validate the design. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

A reputation mechanism for layered communities

Loading next page...
 
/lp/association-for-computing-machinery/a-reputation-mechanism-for-layered-communities-zaA9Qnm4QW
Publisher
Association for Computing Machinery
Copyright
Copyright © 2006 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1150735.1150738
Publisher site
See Article on Publisher Site

Abstract

The exchange of digital goods via peer-to-peer (P2P) systems is a challenging problem for e-commerce. Participants rarely know each other, and may be completely anonymous, so the self-interest of the participants works against trust and they miss out on the benefits of cooperation. Reputation mechanisms help to remedy selfish misbehaviour. In this paper a new layered reputation mechanism establishes a trusted P2P environment, with bad content filtered out and novel content continuously introduced, by giving appropriate incentives to participants. A simulation was created and experiments run to validate the design.

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Jun 1, 2006

There are no references for this article.