Automata playing iterated Prisoner’s Dilemma
Abstract
This study deals with deterministic strategies for playing the iterated Prisoner's Dilemma. Each strategy is incorporated into the table of a finite state automaton. 4-bit and 16-bit strategies are exhaustively studied on this paper, meanwhile 64-bit strategies have been approached by means of a Genetic Algorithm. Both ideas, of studying deterministic strategies and using a Genetic Algorithm, are in Axelrod's The Complexity of Cooperation.
Regardings4-bit strategies, a conclusion has been imposed: Tit for Tat is not the winning strategy.
Regarding 16-bit strategies, Tit for Tat has not been the winner either.
Regarding 64-bit strategies, we should mention the method to evolve chromosomes found by the Genetic Algorithm confronting them with a control set of strategies. There are also 64-bit strategies better than Tit for Tat.
Downloads
Article download
Crossmark
License
In order to support the global exchange of knowledge, the journal Revista de Filosofía is allowing unrestricted access to its content as from its publication in this electronic edition, and as such it is an open-access journal. The originals published in this journal are the property of the Complutense University of Madrid and any reproduction thereof in full or in part must cite the source. All content is distributed under a Creative Commons Attribution 4.0 use and distribution licence (CC BY 4.0). This circumstance must be expressly stated in these terms where necessary. You can view the summary and the complete legal text of the licence.
