A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Incentive compatible mechanism for trust revelation
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
A reputation-based trust model for peer-to-peer ecommerce communities [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Helping based on future expectations
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A Game Theoretic Framework for Incentives in P2P Systems
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Robust incentive techniques for peer-to-peer networks
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Monopolizing markets by exploiting trust
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
A connection management protocol for promoting cooperation in Peer-to-Peer networks
Computer Communications
Cooperative Interactions: An Exchange Values Model
Coordination, Organizations, Institutions, and Norms in Agent Systems II
AIS-ADM'07 Proceedings of the 2nd international conference on Autonomous intelligent systems: agents and data mining
Video streaming over P2P networks: Challenges and opportunities
Image Communication
Hi-index | 0.00 |
Peer-to-peer (P2P) systems enable users to share resources in a networked environment without worrying about issues such as scalability and load balancing. Unlike exchange of goods in a traditional market, resource exchange in P2P networks does not involve monetary transactions. This makes P2P systems vulnerable to problems including the free-rider problem that enables users to acquire resources without contributing anything, collusion between groups of users to incorrectly promote or malign other users, and zero-cost identity that enables nodes to obliterate unfavorable history without incurring any expenditure. Previous research addresses these issues using user-reputation, referrals, and shared history based techniques. Here, we describe a multi-agent based reciprocity mechanism where each user's agent makes the decision to share a resource with a requesting user based on the amount of resources previously provided by the requesting user to the providing user and globally in the system. A robust reputation mechanism is proposed to avoid the differential exploitations by the free-riders and to prevent collusion. Experimental results on a simulated P2P network addresses the problems identified above and shows that users adopting the reciprocative mechanism outperform users that do not share resources in the P2P network. Hence, our proposed reciprocative mechanism effectively suppresses free-riding.