IDEAS home Printed from https://ideas.repec.org/p/sce/scecf0/172.html
   My bibliography  Save this paper

Stabilization Of Tag-Mediated Interaction By Sexual Reproduction In An Evolutionary Agent System

Author

Listed:
  • F. Alkemade

    (CWI , room M135)

  • J.A. La Poutre

    (CWI, room M332)

  • D.D.B. van Bragt

    (CWI, room M335)

Abstract

The evolution of cooperation in a system of agents playing the iterated prisoner's dilemma (IPD) is investigated. In our computational model, agents can recognize each other and decide whether to interact or not based upon ``tags'' (labels). We consider the evolutionary stability of the evolving populations. Previous work is extended by introducing sexual reproduction (recombination) of agents and by analyzing its influence on the evolving populations. We observed the occasional formation of very stable cooperative societies, as opposed to previous results without sexual reproduction. These cooperative societies are able to resist invasions of ``mimics'' (defecting agents with the tag of a cooperating agent).

Suggested Citation

  • F. Alkemade & J.A. La Poutre & D.D.B. van Bragt, 2000. "Stabilization Of Tag-Mediated Interaction By Sexual Reproduction In An Evolutionary Agent System," Computing in Economics and Finance 2000 172, Society for Computational Economics.
  • Handle: RePEc:sce:scecf0:172
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Floortje Alkemade & Han Poutré & Hans Amman, 2006. "Robust Evolutionary Algorithm Design for Socio-economic Simulation," Computational Economics, Springer;Society for Computational Economics, vol. 28(4), pages 355-370, November.
    2. Waltman, L. & van Eck, N.J.P., 2009. "A Mathematical Analysis of the Long-run Behavior of Genetic Algorithms for Social Modeling," ERIM Report Series Research in Management ERS-2009-011-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:sce:scecf0:172. 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: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.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.