IDEAS home Printed from https://ideas.repec.org/p/dbe/wpaper/0214.html
   My bibliography  Save this paper

Analysis of Strategies to Promote Cooperation in Distributed Service Discovery

Author

Listed:
  • Guillem Martínez-Canovas

    (ERI-CES)

  • Elena Del Val

    (DSIC, Polytechnic University of Valencia
    edelval@dsic.upv.es)

  • Vicente Botti

    (DSIC, Polytechnic University of Valencia)

  • Penélope Hernández

    (ERI-CES)

  • Miguel Rebollo

    (DSIC, Polytechnic University of Valencia)

Abstract

New systems can be designed, developed, and managed as societies of agents that interact with each other by offering and providing services. These systems can be viewed as complex networks where nodes are bounded rational agents. In order to deal with complex goals, they require the cooperation of the other agents to be able to locate the required services. In this paper, we present a theoretical model that formalizes the interactions among agents in a search process. We present a repeated game model where the actions that are involved in the search process have an associated cost. Also, if the task arrives to an agent that can perform it, there is a reward for agents that collaborated by forwarding queries. We propose a strategy that is based on random-walks, and we study under what conditions the strategy is a Nash Equilibrium. We performed several experiments in order to validate the model and the strategy and to analyze which network structures are more appropriate to promote cooperation.

Suggested Citation

  • Guillem Martínez-Canovas & Elena Del Val & Vicente Botti & Penélope Hernández & Miguel Rebollo, 2014. "Analysis of Strategies to Promote Cooperation in Distributed Service Discovery," Discussion Papers in Economic Behaviour 0214, University of Valencia, ERI-CES.
    • Handle: RePEc:dbe:wpaper:0214
    as

    Download full text from publisher

    File URL: https://www.uv.es/erices/RePEc/WP/2014/0214.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Repeated games; Networks; Nash Equilibrium; Random-walk; Service Discovery;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:dbe:wpaper:0214. 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: Emilio Calvo Ramón (email available below). General contact details of provider: https://edirc.repec.org/data/ericees.html .

    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.