Skip to Main content Skip to Navigation

Modèles et simulations informatiques des problèmes de coopération entre agents

Bruno Beaufils 1, 2
2 SMAC - Systèmes Multi-Agents et Comportements
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : The iterated prisoner's dilemma is a cooperation between agents mathematical representation. This model comes from game theory, which initial goal is to study conflict of interest situations. Unfortunately results implied by the theory on the prisoner's dilemma are so poor that it could not be used seriously. A new evolutionary approach, mainly based on computer simulations, has been initiated by Robert Axelrod. Agents are characterized by their behavior, or strategy. Axelrod brings to the fore four properties a strategy has to respect in order to be efficient, and propose the tit_for_tat strategy as an example.

Our work is to study and increase knowledge on those kind of simulations. We adapt the model such that it takes into account the fact that computing is a discrete job. This adaptation allows us to make a lot of simulations which confirm main results obtained in the continuous case. This, however, call into question one of Axelrod property: simplicity. We describe strategies more efficient than tit_for_tat but with a higher level of complexity. Evaluations are done by simulations involving a big number of strategies build objectively via a genetic approach.

Those simulations allow us to find a new property: behavior adaptation faculty. This new property enforce the idea that cooperative behavior between agents may be more and more complex.

We also start the study of a particular prisoner's dilemma, which differs from the classical model only in the iterated version and which allows to represent two level of cooperation: the lift dilemma. This theoretical as well as experimental study allow us to show that with this new model no purely deterministic behavior can be efficient.
Document type :
Complete list of metadata
Contributor : Bruno Beaufils <>
Submitted on : Saturday, March 7, 2009 - 1:40:33 AM
Last modification on : Friday, December 11, 2020 - 6:44:02 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 11:12:15 PM


  • HAL Id : tel-00366446, version 1


Bruno Beaufils. Modèles et simulations informatiques des problèmes de coopération entre agents. Informatique [cs]. Université des Sciences et Technologie de Lille - Lille I, 2000. Français. ⟨tel-00366446⟩



Record views


Files downloads