Please use this identifier to cite or link to this item:
|Title:||Evolution and incremental learning in the Iterative Prisoner's Dilemma|
|Source:||Goh, C.K.,Quek, H.Y.,Teoh, E.J.,Tan, K.C. (2005). Evolution and incremental learning in the Iterative Prisoner's Dilemma. 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings 3 : 2629-2636. ScholarBank@NUS Repository.|
|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. ©2005 IEEE.|
|Source Title:||2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.