ACM Home Page
Please provide us with feedback. Feedback
Efficiency and nash equilibria in a scrip system for P2P networks
Full text PdfPdf (239 KB)
Source Electronic Commerce archive
Proceedings of the 7th ACM conference on Electronic commerce table of contents
Ann Arbor, Michigan, USA
Pages: 140 - 149  
Year of Publication: 2006
ISBN:1-59593-236-4
Authors
Eric J. Friedman  Cornell University
Joseph Y. Halpern  Cornell University
Ian Kash  Cornell University
Sponsors
ACM: Association for Computing Machinery
SIGEcom: ACM Special Interest Group on Electronic Commerce
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 67,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1134707.1134723
What is a DOI?

ABSTRACT

A model of providing service in a P2P network is analyzed. It is shown that by adding a scrip system, a mechanism that admits a reasonable Nash equilibrium that reduces free riding can be obtained. The effect of varying the total amount of money (scrip) in the system on efficiency (i.e., social welfare) is analyzed, and it is shown that by maintaining the appropriate ratio between the total amount of money and the number of agents, efficiency is maximized. The work has implications for many online systems, not only P2P networks but also a wide variety of online forums for which scrip systems are popular, but formal analyses have been lacking.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
E. Adar and B. A. Huberman. Free riding on Gnutella. First Monday, 5(10), 2000.
 
2
 
3
BitTorrent Inc. BitTorrent web site. http://www.bittorent.com.
4
 
5
Cornell Information Technologies. Cornell's ccommodity internet usage statistics. http://www.cit.cornell.edu/computer/students/ bandwidth/charts.html.
 
6
 
7
G. Ellison. Cooperation in the prisoner's dilemma with anonymous random matching. Review of Economic Studies, 61:567--588, 1994.
 
8
eMule Project. eMule web site. http://www.emule-project.net/.
9
10
 
11
E. J. Friedman and P. Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10(2):173--199, 2001.
12
13
 
14
Z. Gyongi, P. Berkhin, H. Garcia-Molina, and J. Pedersen. Link spam detection based on mass estimation. Technical report, Stanford University, 2005.
 
15
J. Ioannidis, S. Ioannidis, A. D. Keromytis, and V. Prevelakis. Fileteller: Paying and getting paid for file storage. In Financial Cryptography, pages 282--299, 2002.
 
16
E. T. Jaynes. Where do we stand on maximum entropy? In R. D. Levine and M. Tribus, editors, The Maximum Entropy Formalism, pages 15--118. MIT Press, Cambridge, Mass., 1978.
17
 
18
M. Kandori. Social norms and community enforcement. Review of Economic Studies, 59:63--80, 1992.
 
19
LogiSense Corporation. LogiSense web site. http://www.logisense.com/tm p2p.html.
 
20
 
21
Open Source Technology Group. Slashdot FAQ - comments and moderation. http://slashdot.org/faq/com-mod.shtml#cm700.
 
22
OSMB LLC. Gnutella web site. http://www.gnutella.com/.
 
23
M. L. Puterman. Markov Decision Processes. Wiley, 1994.
 
24
SETI@home. SETI@home web page. http://setiathome.ssl.berkeley.edu/.
 
25
Sharman Networks Ltd. Kazaa web site. http://www.kazaa.com/.
 
26
V. Vishnumurthy, S. Chandrakumar, and E. Sirer. Karma: A secure economic framework for peer-to-peer resource sharing. In Workshop on Economics of Peer-to-Peer Systems (P2PECON), 2003.
 
27
L. Xiong and L. Liu. Building trust in decentralized peer-to-peer electronic communities. In Internation Conference on Electronic Commerce Research (ICECR), 2002.
 
28
H. Zhang, A. Goel, R. Govindan, K. Mason, and B. V. Roy. Making eigenvector-based reputation systems robust to collusion. In Workshop on Algorithms and Models for the Web-Graph(WAW), pages 92--104, 2004.


Collaborative Colleagues:
Eric J. Friedman: colleagues
Joseph Y. Halpern: colleagues
Ian Kash: colleagues