Please use this identifier to cite or link to this item:
https://doi.org/10.1109/TEVC.2008.2003009
Title: | Evolution and incremental learning in the iterated prisoner's dilemma | Authors: | Quek, H.-Y. Tan, K.C. Goh, C.-K. Abbass, H.A. |
Keywords: | Evolution Genetic algorithm (GA) Incremental learning (IL) Prisoner's dilemma |
Issue Date: | 2009 | Citation: | Quek, H.-Y., Tan, K.C., Goh, C.-K., Abbass, H.A. (2009). Evolution and incremental learning in the iterated prisoner's dilemma. IEEE Transactions on Evolutionary Computation 13 (2) : 303-320. ScholarBank@NUS Repository. https://doi.org/10.1109/TEVC.2008.2003009 | Abstract: | This paper examines the comparative performance and adaptability of evolutionary, learning, and memetic strategies to different environment settings in the Iterated Prisoner's Dilemma (IPD). A memetic adaptation framework is developed for IPD strategies to exploit the complementary features of evolution and learning. In the paradigm, learning serves as a form of directed search to guide evolving strategies to attain eventual convergence towards good strategy traits, while evolution helps to minimize disparity in performance among learning strategies. Furthermore, a double-loop incremental learning scheme (ILS) that incorporates a classification component, probabilistic update of strategies and a feedback learning mechanism is proposed and incorporated into the evolutionary process. A series of simulation results verify that the two techniques, when employed together, are able to complement each other's strengths and compensate for each other's weaknesses, leading to the formation of strategies that will adapt and thrive well in complex, dynamic environments. © 2008 IEEE. | Source Title: | IEEE Transactions on Evolutionary Computation | URI: | http://scholarbank.nus.edu.sg/handle/10635/55920 | ISSN: | 1089778X | DOI: | 10.1109/TEVC.2008.2003009 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.