Ants can play prisoner's dilemma

Simple item page
dc.contributor.authorTekol, Y
dc.contributor.authorAcan, A
dc.date.accessioned2026-02-06T18:28:41Z
dc.date.issued2003
dc.departmentDoğu Akdeniz Üniversitesi
dc.descriptionCongress on Evolutionary Computation (CEC) -- DEC 08-12, 2003 -- Canberra, AUSTRALIA
dc.description.abstractAn 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.
dc.identifier.endpage1354
dc.identifier.isbn0-7803-7804-0
dc.identifier.scopus2-s2.0-82255193774
dc.identifier.scopusqualityN/A
dc.identifier.startpage1348
dc.identifier.urihttps://hdl.handle.net/11129/11070
dc.identifier.wosWOS:000221532900182
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherIEEE
dc.relation.ispartofCec: 2003 Congress on Evolutionary Computation, Vols 1-4, Proceedings
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectOptimization
dc.subjectCooperation
dc.subjectColony
dc.titleAnts can play prisoner's dilemma
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu