Motivating Participation in Peer to Peer Communities

  • Julita Vassileva
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2577)


One of the most important prerequisites for the success of a peer to peer system is the availability of participants willing to provide resources (files, computational cycles, time and effort to the community). Free riders may do no harm in file-sharing applications, like NAPSTER, because of the nature of electronic data, which can be reproduced at no cost; downloading a copy does not take anything away from the common resources. However, free riders can be destructive in applications where there are costs associated with the resources shared. The paper argues that providing motivation or some kind of incentives for users to participate is very important. It describes various methods to motivate different kinds of users and describes a design of a peer to peer system called Comutella, which is being developed currently to support file and service (help, advice) sharing in research groups and groups of learners.


Multiagent System User Interest Computational Cycle Shared Folder Search Horizon 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Adamic L. (1999) The Small World Web. Proc. 3rd European Conf. Research and Advanced Technology for Digital Libraries, ECDL
  2. [2]
    Adar E., Huberman B. (2000) Free Riding on Gnutella. First Monday, vol. 5, no. 10. Also available on line at:
  3. [3]
  4. [4]
    Fogg B.J. (1998) Persuasive Computing: Perspectives and Research Directions, Proceedings CHI’88,
  5. [5]
    Greer J., McCalla G., Vassileva J., Deters R., Bull S., Kettel L. (2001) Lessons Learned in Deploying a Multi-Agent Learning Support System: The I-Help Experience, Proceedings of AI in Education AIED’2001, San Antonio, IOS Press: Amsterdam, 410–421. Available on line at:
  6. [6]
    Golle Ph., Leyton-Brown K., Mironov I. (2001) Incentives for Sharing in Peer-to-Peer Networks. Proceedings EC’01, October 12-17, 2001, Tampa, Florida, ACM press, 264–267Google Scholar
  7. [7]
    Milojicic D., Kalogeraki V., Lukose R., Nagaraja K., Pruyne J., Richard B., Rollins S., Xu Z. (2002) Peer to Peer Computing. Technical Report HPL-2002-57, HP Laboratories Palo AltoGoogle Scholar
  8. [8]
    Ramanathan M. K., Kalogeraki, V. Pruyne J. (2001) Finding Good Peers in Peer-to-Peer Networks. Technical Report HPL-2001-271, HP Laboratories Palo AltoGoogle Scholar
  9. [9]
    Vassileva J., J. Greer, G. McCalla, R. Deters, D. Zapata, C. Mudgal, S. Grant (1999) A Multi-Agent Approach to the Design of Peer-Help Environments, in Proceedings of AIED’99, Le Mans, France, July, 1999, 38-45. Available on line at:
  10. [10]
    Vassileva J. (2001) Distributed User Modelling for Universal Information Access, C. Stephanidis (ed.) “Universal Access in Human-Computer Interaction (UAHCI)”, Proceedings of the 9th International Conference on Human-Computer Interaction, New Orleans, USA, vol.3, Lawrence Erlbaum: Mahwah, N.J., 122–126. Avaliable on line at:
  11. [11]
    Wilcox-O’Hearn B. (2002) Experiences Deploying a Large-Scale Emergent Network, in Electronic Proceedings for the 1st International Workshop on Peer-to-Peer Systems (IPTPS’ 02)
  12. [12]
    Wilde O. (1891) The Picture of Dorian Gray
  13. [13]
    Yu, B., Singh. M. (2002) Emergence of Agent-Based Referral Networks. Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: part 3, July 2002, Bologna, July 15-19, 2002Google Scholar
  14. [14]
    Shirky C. (2000) In Praise of Freeloaders, The O’Reilly Network. Available on line at:

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Julita Vassileva
    • 1
  1. 1.Computer Science DepartmentUniversity of SaskatchewanSaskatchewanCanada

Personalised recommendations