IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v6y2012i1p43-55.html
   My bibliography  Save this article

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

Author

Listed:
  • J-S Hua
  • S-M Huang
  • D C Yen
  • C-W Chena

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.

Suggested Citation

  • J-S Hua & S-M Huang & D C Yen & C-W Chena, 2012. "A dynamic game theory approach to solve the free riding problem in the peer-to-peer networks," Journal of Simulation, Taylor & Francis Journals, vol. 6(1), pages 43-55, February.
    • Handle: RePEc:taf:tjsmxx:v:6:y:2012:i:1:p:43-55
    DOI: 10.1057/jos.2011.11
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/jos.2011.11
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jos.2011.11?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjsmxx:v:6:y:2012:i:1:p:43-55. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.