Incentives for combatting freeriding on P2P networks

25Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We address the freerider problem on P2P networks. We first propose a specific participation metric, which we call a peer's EigenTrust score. We show that EigenTrust scores accurately capture several different participation criteria. We then propose an incentive scheme that may be used in conjunction with any numerical participation metric. We show that, when these incentives are used in conjunction with EigenTrust scores, they reward participatory peers but don't exclude less active peers. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2004). Incentives for combatting freeriding on P2P networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 1273–1279. https://doi.org/10.1007/978-3-540-45209-6_171

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free