New Winning Strategies for the Iterated Prisoner's Dilemma

Abstract : In the iterated prisoner's dilemma game, new successful strategies are regularly proposed especially outperforming the well-known tit_for_tat strategy. New forms of reasoning have also recently been introduced to analyse the game. They lead William Press and Freeman Dyson to a double infinite family of strategies that-theoretically-should all be eeicient strategies. In this paper, we study and confront using several experimen-tations the main strategies introduced since the discovery of tit_for_tat. We make them play against each other in varied and neutral environments. We use the complete classes method that leads us to the formulation of four new simple strategies with surprising results. We present massive experiments using simulators specially developed that allow us to confront up to ,,,, strategies simultaneously, which had never been done before. Our results show without any doubt the most robust strategies among those so far identified. This work defines new systematic, reproductible and objective experiments suggesting several ways to design strategies that go a step further, and a step in the sooware design technology to highlight eeicient strategies in iterated prisoner's dilemma and multiagent systems in general.
Type de document :
Article dans une revue
Journal of Artificial Societies and Social Simulation, SimSoc Consortium, 2017, 20 (4), 〈10.18564/jasss.3517〉
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01635333
Contributeur : Cristal Equipe Smac <>
Soumis le : mercredi 15 novembre 2017 - 09:25:05
Dernière modification le : mardi 3 juillet 2018 - 11:39:41
Document(s) archivé(s) le : vendredi 16 février 2018 - 12:41:32

Fichier

12.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Philippe Mathieu, Jean-Paul Delahaye. New Winning Strategies for the Iterated Prisoner's Dilemma. Journal of Artificial Societies and Social Simulation, SimSoc Consortium, 2017, 20 (4), 〈10.18564/jasss.3517〉. 〈hal-01635333〉

Partager

Métriques

Consultations de la notice

212

Téléchargements de fichiers

100