DocumentCode :
412660
Title :
Ants can play prisoner´s dilemma
Author :
Tekol, Yüce ; Acan, Adnan
Author_Institution :
Comput. Eng. Dept., Eastern Mediterranean Univ., Mersin, Turkey
Volume :
2
fYear :
2003
fDate :
8-12 Dec. 2003
Firstpage :
1348
Abstract :
An ant colony optimization approach towards the development of robust game strategies for iterated prisoner´s dilemma (IPD) is presented. It is demonstrated that, ants can play IPD and, in spite of comparably longer running times, provide game strategies of better quality than the genetic algorithms. The success of the developed strategies, compared to the ones developed using genetic algorithms are illustrated by experimental evaluations.
Keywords :
artificial life; game theory; games of skill; genetic algorithms; ant colony optimization approach; genetic algorithms; iterated prisoner dilemma; robust game strategy; Ant colony optimization; Application software; Biological system modeling; Biology; Computer science; Genetic algorithms; Linear matrix inequalities; Resists; Robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN :
0-7803-7804-0
Type :
conf
DOI :
10.1109/CEC.2003.1299825
Filename :
1299825
Link To Document :
بازگشت