IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-0754-6_5.html
   My bibliography  Save this book chapter

Growing Networks Driven by the Evolutionary Prisoner’s Dilemma Game

In: Handbook of Optimization in Complex Networks

Author

Listed:
  • J. Poncela

    (Institute for Biocomputation and Physics of Complex Systems)

  • J. Gómez-Gardeñes

    (Institute for Biocomputation and Physics of Complex Systems)

  • L. M. Floría

    (Institute for Biocomputation and Physics of Complex Systems
    Universidad de Zaragoza)

  • Yamir Moreno

    (Universidad de Zaragoza)

Abstract

In this chapter, we present a model of growing networks in which the attachment of nodes is driven by the dynamical state of the evolving network. In particular, we study the interplay between form and function during network formation by considering that the capacity of a node to attract new links from newcomers depends on a dynamical variable: its evolutionary fitness. The fitness of nodes are governed in turn by the payoff obtained when playing a weak Prisoner’s Dilemma game with their nearest neighbors. Thus, we couple the structural evolution of the system with its evolutionary dynamics. On the one hand, we study both the levels of cooperation observed during network evolution and the structural outcome of the model. Our results point out that scale-free networks arise naturally in this setting and that they present non-trivial topological attributes such as degree-degree correlations and hierarchical clustering. On the other hand, we also look at the long-term survival of the cooperation on top of these networks, once the growth has finished. This mechanism points to an evolutionary origin of real complex networks and can be straightforwardly applied to other kinds of dynamical networks problems.

Suggested Citation

  • J. Poncela & J. Gómez-Gardeñes & L. M. Floría & Yamir Moreno, 2012. "Growing Networks Driven by the Evolutionary Prisoner’s Dilemma Game," Springer Optimization and Its Applications, in: My T. Thai & Panos M. Pardalos (ed.), Handbook of Optimization in Complex Networks, edition 1, chapter 0, pages 115-136, Springer.
  • Handle: RePEc:spr:spochp:978-1-4614-0754-6_5
    DOI: 10.1007/978-1-4614-0754-6_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:spochp:978-1-4614-0754-6_5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.