Game theoretical analysis of incentives for large-scale, fully decentralized collaboration networks

One of the key challenges in peer-to-peer networks is the design of incentives to encourage peers to share their resources. Incentives are necessary in order to exploit the full potential of these systems. The tit-for-tat incentive scheme, as used in BitTorrent for example, has proven to be a successful approach in P2P file sharing systems, where peers have direct relations and share the same kind of resources. However, in P2P systems where different kind of resources are shared between peers with non-direct relations, the design of incentives remains a challenge. In this paper, a large-scale, fully decentralized P2P collaboration network is shown, where peers share not only bandwidth and storage space, but also contribute by editing articles and voting for or against changes. A new incentive scheme is proposed which supports non-direct relations and provides incentives for sharing different kind of resources. The incentive scheme is based on a reputation system that assigns a reputation value to every peer reflecting its previous behavior in the network. Based on this value, the service level is differentiated, i.e. the higher a peer's reputation the better the quality of service it can get from the network. The service differentiation has been analyzed and simulated with rational, irrational and altruistic peers based on game theory concepts.

[1]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[2]  R. Frank Microeconomics and behavior , 1991 .

[3]  W. Hamilton,et al.  The evolution of cooperation. , 1984, Science.

[4]  Alex M. Andrew,et al.  ROBOT LEARNING, edited by Jonathan H. Connell and Sridhar Mahadevan, Kluwer, Boston, 1993/1997, xii+240 pp., ISBN 0-7923-9365-1 (Hardback, 218.00 Guilders, $120.00, £89.95). , 1999, Robotica (Cambridge. Print).

[5]  Ion Stoica,et al.  Robust incentive techniques for peer-to-peer networks , 2004, EC '04.

[6]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[7]  Yu Peng,et al.  Robust incentives via multi‐level Tit‐for‐Tat , 2008, IPTPS.

[8]  Dan S. Wallach,et al.  A Taxonomy of Rational Attacks , 2005, IPTPS.

[9]  David K. Y. Yau,et al.  A game theoretic approach to provide incentive and service differentiation in P2P networks , 2004, SIGMETRICS '04/Performance '04.

[10]  David C. Parkes,et al.  Rationality and Self-Interest in Peer to Peer Networks , 2003, IPTPS.

[11]  Philipp Obreiter,et al.  A Taxonomy of Incentive Patterns - The Design Space of Incentives for Cooperation , 2003, AP2PC.

[12]  Flavio D. Garcia,et al.  Off-Line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications , 2005, ACNS.

[13]  Burkhard Stiller,et al.  Peer-to-Peer Large-Scale Collaborative Storage Networks , 2007, AIMS.

[14]  Christos H. Papadimitriou,et al.  Free-riding and whitewashing in peer-to-peer systems , 2004, IEEE Journal on Selected Areas in Communications.

[15]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[16]  Christos H. Papadimitriou,et al.  Free-riding and whitewashing in peer-to-peer systems , 2006, IEEE J. Sel. Areas Commun..

[17]  Geoff Coulson,et al.  Free Riding on Gnutella Revisited: The Bell Tolls? , 2005, IEEE Distributed Syst. Online.

[18]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[19]  Robert Sedgewick,et al.  Algorithms in Java , 2003 .

[20]  Roger Wattenhofer,et al.  Havelaar: A Robust and Efficient Reputation Systemfor Active Peer-to-Peer Systems , 2006 .