IDEAS home Printed from https://ideas.repec.org/p/uto/dipeco/200604.html
   My bibliography  Save this paper

Beating the Tit for Tat: Using a Genetic Algorithm to Build an Effective Adaptive Behavior

Author

Listed:

Abstract

Agents capable of adaptive behavior can be obtained by means of AI tools. Thanks to these, they develop the ability to vary their Behavior in order to achieve satisfying results in the simulated environment. In the paper, artificially intelligent agents play an iterated prisoner' s dilemma against agents that reproduce (in a fix way) strategies that have emerged in Axelrod' s toumament. The objective of the adaptive agent is to earn a payoff higher than one of the Tit-for-tat, the strategy which has shown the better performance in the Axelrod's experimental setup. In the work, Genetic Algorithms are employed to produce and modify rules that are apt to achieve the set task. The adaptive dynamics is analysed in depth in order to understand the issues related to the codification of knowledge and to the evaluation of diverse strategies. In order to highlight different nuances of these matters we have amended the method as to improve it and experimented different knowledge's codifications.

Suggested Citation

  • Ferraris Gianluigi & Fontana Magda, 2006. "Beating the Tit for Tat: Using a Genetic Algorithm to Build an Effective Adaptive Behavior," Department of Economics and Statistics Cognetti de Martiis. Working Papers 200604, University of Turin.
    • Handle: RePEc:uto:dipeco:200604
    as

    Download full text from publisher

    File URL: http://www.est.unito.it/do/home.pl/Download?doc=/allegati/wp2006dip/4_wp_fontanaferraris.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Tesfatsion, Leigh S., 2009. "Web Site for Agent-Based Computational Economics (ACE)," Staff General Research Papers Archive 4021, Iowa State University, Department of Economics.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      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:uto:dipeco:200604. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Piero Cavaleri or Marina Grazioli (email available below). General contact details of provider: https://edirc.repec.org/data/detorit.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.