Paper Info
Title
Free-Riding Analysis Via Dynamic Game With Incomplete Information
Abstract
P2P networks are distributed, acentric and self-organized systems. Due to the incomplete information of network environment, the uncertainty of trust relationship among peers and the selfishness of the peers in P2P networks, which give rise to many free-riders that seriously impact the stability and scalability of P2P networks. In this paper, by analyzing the incomplete information of network environment, the uncertainty of trust relationship among nodes, the phenomenon of the free-riding is studied based on game theory. The IIDGTrust (Incomplete Information Dynamic Game Trust) mechanism is presented through the case "Supplying the Public Resources". Updating the trust relationship among the nodes according to the Bayesian law, which make nodes choose better strategies in time. The experimental results demonstrate that the IIDGTrust mechanism can effectively reduce the proportion of the free-riders in the P2P networks and maintain the stability of networks better.
Year
DOI
Venue
2012
10.1016/j.procs.2012.04.148
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE, ICCS 2012
Keywords
DocType
Volume
Free-riding, Incomplete Information Dynamic Game, Bayesian law, Perfect Bayesian-Nash Equilibrium
Journal
9
ISSN
Citations 
PageRank 
1877-0509
0
0.34
References 
Authors
4
3
Name
Order
Citations
PageRank
Guoyong Cai15114.50
Guo-bin Liu200.34
Guimin Huang369.26