IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v5y2009i1p59-59.html
   My bibliography  Save this article

Resource Allocation Model Based on Non-Cooperative Bidding Game in P2P Network

Author

Listed:
  • Jun Tao

Abstract

Game theory is applied to studying the P2P resource allocation technologies further in this paper. The mechanism of P2P resource pricing, which shows the relation of supply and demand, was presented based on bidding. Subsequently, we designed the utility function of end system and proved the existence and uniqueness of Nash Equilibrium in P2P resource allocation game. At last, we present a P2P resource allocation algorithm (PRANG) based on the resource allocation game model. The results of the experiment and the simulation show that PRANG algorithm can provide references for the quantity of resource that users demand and regularize the users' bids. Consequently, the allocation of the whole P2P resource tends to be more reasonable.

Suggested Citation

  • Jun Tao, 2009. "Resource Allocation Model Based on Non-Cooperative Bidding Game in P2P Network," International Journal of Distributed Sensor Networks, , vol. 5(1), pages 59-59, January.
    • Handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:59-59
    DOI: 10.1080/15501320802554620
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802554620
    Download Restriction: no
    File URL: https://libkey.io/10.1080/15501320802554620?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
    ---><---

    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:sae:intdis:v:5:y:2009:i:1:p:59-59. 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: SAGE Publications (email available below). General contact details of provider: .

    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.