Co-evolution of strategies for an N-player dilemma

Research output: Chapter in Book or Conference Publication/ProceedingConference Publicationpeer-review

6 Citations (Scopus)

Abstract

This paper presents results on coevolving classes of strategies for the N-player Iterated Prisoner's Dilemma (NIPD). We incorporate the notion of forgiveness in strategies and present experimental results which show that higher levels of cooperation and fitness are attainable when strategies are forgiving.

Original languageEnglish
Title of host publicationProceedings of the 2004 Congress on Evolutionary Computation, CEC2004
Pages1625-1630
Number of pages6
Publication statusPublished - 2004
EventProceedings of the 2004 Congress on Evolutionary Computation, CEC2004 - Portland, OR, United States
Duration: 19 Jun 200423 Jun 2004

Publication series

NameProceedings of the 2004 Congress on Evolutionary Computation, CEC2004
Volume2

Conference

ConferenceProceedings of the 2004 Congress on Evolutionary Computation, CEC2004
Country/TerritoryUnited States
CityPortland, OR
Period19/06/0423/06/04

Fingerprint

Dive into the research topics of 'Co-evolution of strategies for an N-player dilemma'. Together they form a unique fingerprint.

Cite this