Gosling, T and Jin, N and Tsang, E (2004) CSM-401 - Population based Incremental Learning vesus Genetic Algorithms: Iterated Prisoners Dilemma. UNSPECIFIED. CSM-401, University of Essex, Colchester.
|
Text
csm-401.pdf Download (144kB) | Preview |
Abstract
Axelrod?s originally 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 while PBIL performs well, GA in general does slightly better although more experiments should be conducted.
| Item Type: | Monograph (UNSPECIFIED) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
| SWORD Depositor: | Elements |
| Depositing User: | Elements |
| Date Deposited: | 27 Feb 2014 11:52 |
| Last Modified: | 06 Jan 2022 13:34 |
| URI: | http://repository.essex.ac.uk/id/eprint/8684 |
Actions (login required)
 |
View Item |