ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Mathematical modeling of incentive policies in p2p systems
Full text PdfPdf (180 KB)
Source
Applications, Technologies, Architectures, and Protocols for Computer Communication archive
Proceedings of the 3rd international workshop on Economics of networked systems table of contents
Seattle, WA, USA
SESSION: Session 5 table of contents
Pages: 97-102  
Year of Publication: 2008
ISBN:978-1-60558-179-8
Authors
Bridge Q. Zhao  The Chinese University of Hong Kong, Hong Kong, Hong Kong
John C.S. Lui  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Dah-Ming Chiu  The Chinese University of Hong Kong, Hong Kong, Hong Kong
Sponsors
ACM: Association for Computing Machinery
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 69,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1403027.1403049
What is a DOI?

ABSTRACT

In order to stimulate cooperation among nodes in P2P systems, some form of incentive mechanism is necessary so as to encourage service contribution. Hence, designing and evaluating the stability, robustness and performance of incentive policies is extremely critical. In this paper, we propose a general mathematical framework to evaluate the stability and evolution of a family of shared history based incentive policies. To illustrate the utility of the framework, we present two incentive policies and show why one incentive policy can lead to a total system collapse while the other is stable and operates at the optimal point. One can use this mathematical framework to design and analyze various incentive policies and verify whether they match the design objectives of the underlying P2P systems.


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
2
 
3
M. Feldman, C. Papadimitriou, J. Chuang, and I. Stoica. Free-riding and whitewashing in peer-to-peer systems. In Workshop on Economics and Information Security, 2004.
 
4
 
5
K. Lai, M. Feldman, I. Stoica, and J. Chuang. Incentives for cooperation in P2P networks. In Workshop on Economics of P2P Systems, 2003.
6
 
7
 
8
 
9
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 Networks, 2003.
10


Collaborative Colleagues:
Bridge Q. Zhao: colleagues
John C.S. Lui: colleagues
Dah-Ming Chiu: colleagues