Skip to main navigation Skip to search Skip to main content

Evolution and incremental learning in the Iterative Prisoner's Dilemma

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

This paper investigates the use of evolution and Incremental learning to find an optimal strategy in the Iterative Prisoner's Dilemma (IPD) problem, given an environment with a collection of unknown strategies. The Meta-Lamarckian Memetic Learning (MLML) scheme is conceptualized based on the biological evolution of man and his abilities to accumulate knowledge and learn from past experiences. Learning was found to be the dominant force for improvement in the short run while improvement in the long run is sustained by the process of evolution. Learning is also much more effective when carried out on an incremental basis as the games progress. A series of simulation results obtained verified that the best performance is attained when a hybrid combination of learning and evolution is carried out on an incremental basis, not just evolution or learning alone.
Original languageEnglish
Title of host publication2005 IEEE Congress on Evolutionary Computation
PublisherIEEE
Pages2629-2636
Volume3
ISBN (Print)0-7803-9363-5
DOIs
Publication statusPublished - Sept 2005
Externally publishedYes
Event2005 IEEE Congress on Evolutionary Computation (CEC 2005) - Edinburgh, Scotland, United Kingdom
Duration: 2 Sept 20055 Sept 2005

Publication series

Name
Volume3

Conference

Conference2005 IEEE Congress on Evolutionary Computation (CEC 2005)
PlaceUnited Kingdom
CityEdinburgh, Scotland
Period2/09/055/09/05

Fingerprint

Dive into the research topics of 'Evolution and incremental learning in the Iterative Prisoner's Dilemma'. Together they form a unique fingerprint.

Cite this