Free-riding and whitewashing in peer-to-peer systems

被引:140
作者
Feldman, M [1 ]
Papadimitriou, C
Chuang, J
Stoica, I
机构
[1] Hebrew Univ Jerusalem, Sch Comp Sci & Engn, IL-91904 Jerusalem, Israel
[2] Univ Calif Berkeley, Comp Sci Div, Berkeley, CA 94720 USA
[3] Univ Calif Berkeley, Sch Informat Management & Syst, Berkeley, CA 94720 USA
基金
美国国家科学基金会;
关键词
free; riding; incentives; peer-to-peer (P2P); white-washing;
D O I
10.1109/JSAC.2006.872882
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 [电气工程]; 0809 [电子科学与技术];
摘要
We devise a model to study the phenomenon of free-riding and free-identities in peer-to-peer systems. At the heart of our model is a user of a certain type, an intrinsic and private parameter that reflects the user's willingness to contribute resources to the system. A user decides whether to contribute or free-ride based on how the current contribution cost in the system compares to her type. We study the impact of mechanisms that exclude low type users or, more realistically, penalize free-riders with degraded service. We also consider dynamic scenarios with arrivals and departures of users, and with whitewashers-users who leave the system and rejoin with new identities to avoid reputational penalties. We find that imposing penalty on all users that join the system is effective under many scenarios. In particular, system performance degrades significantly only when the turnover rate among users is high. Finally, we show that the optimal exclusion or penalty level differs significantly from the level that optimizes the performance of contributors only for a limited range of societal generosity levels.
引用
收藏
页码:1010 / 1019
页数:10
相关论文
共 16 条
[1]
Adar E., 2000, 1 MONDAY, V5
[3]
[Anonymous], P 3 ACM C EL COMM OC
[4]
[Anonymous], EC J
[5]
[Anonymous], 2003, P 12 INT WORLD WID W
[6]
A game theoretic framework for incentives in P2P systems [J].
Buragohain, C ;
Agrawal, D ;
Suri, S .
THIRD INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING (P2P2003), PROCEEDINGS, 2003, :48-56
[7]
Camerer C, 2003, BEHAV GAME THEORY
[8]
CASTRO M, 2002, P MULT COMPUT NETW
[9]
CROWCROFT J, 2003, P MODELING OPTIMIZAT
[10]
Feldman M., 2004, P ACM C EL COMM