In this paper, we focus on the problem of maintaining significant levels of cooperation in peer-to-peer (P2P) networks of selfish adaptive peers. We propose a simple algorithm that maintains high levels of cooperation in such a network while performing the collective task of file sharing. The algorithm is adapted from novel "tag" models of cooperation that do not rely on explicit reciprocity, reputation or trust mechanisms. A sequence of three simulation models is presented-starting with an abstract model of tag-based cooperation (TagWorld) and finishing with a P2P file-sharing model (FileWorld) that puts the technique to work. From analysis of extensive computer simulations, we demonstrate the technique to be scalable, robust, and decentralized; it requires no central servers or authorities. The algorithm is relatively simple: peers do not need to store additional trust information about other nodes or to perform significant additional processing.
No takes yet. Share an insight, caveat, or question.
Hales et al. (2005) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: