DocumentCode :
445530
Title :
Population based incremental learning with guided mutation versus genetic algorithms: iterated prisoners dilemma
Author :
Gosling, Timothy ; Jin, Nanlin ; Tsang, Edward
Author_Institution :
Dept. of Comput. Sci., Univ. of Essex, Chelmsford
Volume :
1
fYear :
2005
fDate :
5-5 Sept. 2005
Firstpage :
958
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 difference in performance can be mitigated and reversed through the use of a `guided´ mutation operator
Keywords :
game theory; genetic algorithms; learning (artificial intelligence); genetic algorithm; guided mutation operator; iterated prisoners dilemma; population based incremental learning; Computer science; Evolutionary computation; Genetic algorithms; Genetic mutations; Learning systems; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2005. The 2005 IEEE Congress on
Conference_Location :
Edinburgh, Scotland
Print_ISBN :
0-7803-9363-5
Type :
conf
DOI :
10.1109/CEC.2005.1554786
Filename :
1554786
Link To Document :
بازگشت