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 differnce in performance can be mitigated and reversed through the use of a 'guided' mutation operator.
Original language | English |
---|---|
Publication status | Published - 2005 |
Event | Congress on Evolutionary Computation - Edinburgh, Scotland Duration: 1 Jan 2005 → … |
Conference
Conference | Congress on Evolutionary Computation |
---|---|
Period | 1/01/05 → … |