Robust incentive techniques for peer-to-peer networks

Michal Feldman*, Kevin Lai, Ion Stoica, John Chuang

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

414 Scopus citations

Abstract

Lack of cooperation (free riding) is one of the key problems that confronts today's P2P systems. What makes this problem particularly difficult is the unique set of challenges that P2P systems pose: large populations, high turnover, asymmetry of interest, collusion, zero-cost identities, and traitors. To tackle these challenges we model the P2P system using the Generalized Prisoner's Dilemma (GPD), and propose the Reciprocative decision function as the basis of a family of incentives techniques. These techniques are fully distributed and include: discriminating server selection, maxflow-based subjective reputation, and adaptive stranger policies. Through simulation, we show that these techniques can drive a system of strategic users to nearly optimal levels of cooperation.

Original languageEnglish
Pages102-111
Number of pages10
DOIs
StatePublished - 2004
Externally publishedYes
EventProceedings of the 5th ACM Conference on Electronic Commerce,EC'04 - New York, NY, United States
Duration: 17 May 200420 May 2004

Conference

ConferenceProceedings of the 5th ACM Conference on Electronic Commerce,EC'04
Country/TerritoryUnited States
CityNew York, NY
Period17/05/0420/05/04

Keywords

  • Cheap pseudonyms
  • Collusion
  • Free-riding
  • Incentives
  • Peer-to-peer
  • Prisoners dilemma
  • Reputation
  • Whitewash

Fingerprint

Dive into the research topics of 'Robust incentive techniques for peer-to-peer networks'. Together they form a unique fingerprint.

Cite this