A dynamic game theory approach to solve the free riding problem in the peer-to-peer networks

J-S Hua, S-M Huang, D C Yen and C-W Chena

Journal of Simulation, 2012, vol. 6, issue 1, 43-55

Abstract: The peer-to-peer (P2P) system has prevailed on the Internet. The old client-server architecture is gradually becoming unable to satisfy users’ various requests and deal with the heavy loading of networks. Many applications adopt P2P architecture to provide more flexible and efficient service. However, P2P systems are not flawless. The anarchic property of P2P systems keeps participant behaviour uncontrolled. Thus, the behaviour of free riding occurs. This paper uses game theory to explore what results from free riding, designs a co-opetition framework to solve the free riding problem, and also proposes a fairness index to monitor the efficiency of the whole system. Simulations are used to test co-opetition under different environments.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1057/jos.2011.11 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tjsmxx:v:6:y:2012:i:1:p:43-55

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjsm20

DOI: 10.1057/jos.2011.11

Access Statistics for this article

Journal of Simulation is currently edited by Christine Currie

More articles in Journal of Simulation from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().