Population based incremental learning with guided mutation versus genetic algorithms: Iterated prisoners dilemma

Timothy Gosling*, Nanlin Jin, Edward Tsang

*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceedingConference Proceedingpeer-review

8 Citations (Scopus)

Abstract

Axelrod's original experiments for evolving IPD player strategies involved the use of a basic GA. In this paper we examine how well a simple GA performs against the more recent Population Based Incremental Learning system under similar conditions. We find that GA performs slightly better than standard PBIL under most conditions. This differnce in performance can be mitigated and reversed through the use of a 'guided' mutation operator.

Original languageEnglish
Title of host publication2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Pages958-965
Number of pages8
Publication statusPublished - 2005
Externally publishedYes
Event2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 - Edinburgh, Scotland, United Kingdom
Duration: 2 Sept 20055 Sept 2005

Publication series

Name2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Volume1

Conference

Conference2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005
Country/TerritoryUnited Kingdom
CityEdinburgh, Scotland
Period2/09/055/09/05

Fingerprint

Dive into the research topics of 'Population based incremental learning with guided mutation versus genetic algorithms: Iterated prisoners dilemma'. Together they form a unique fingerprint.

Cite this