Beating the Tit for Tat: Using a Genetic Algorithm to Build an Effective Adaptive Behavior
Ferraris Gianluigi () and
Magda Fontana
Department of Economics and Statistics Cognetti de Martiis. Working Papers from University of Turin
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.
Pages: 24 pages
Date: 2006-01
New Economics Papers: this item is included in nep-cbe and nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.est.unito.it/do/home.pl/Download?doc=/a ... _fontanaferraris.pdf (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:uto:dipeco:200604
Access Statistics for this paper
More papers in Department of Economics and Statistics Cognetti de Martiis. Working Papers from University of Turin Contact information at EDIRC.
Bibliographic data for series maintained by Piero Cavaleri () and Marina Grazioli ().