By Topic

Fingerprint Analysis of the Noisy Prisoner's Dilemma Using a Finite-State Representation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Daniel Ashlock ; Dept. of Math. & Stat., Univ. of Guelph, Guelph, ON, Canada ; Eun-Youn Kim ; Wendy Ashlock

Fingerprinting is a technique that permits automatic classification of strategies for playing a game. In this paper, the evolution of strategies for playing the iterated prisoner's dilemma (IPD) at three different noise levels is analyzed using fingerprinting and other techniques including a novel quantity, evolutionary velocity, derived from fingerprinting. The results are at odds with initial expectations and permit the detection of a critical difference in the evolution of agents with and without noise. Noise during fitness evaluation places a larger fraction of an agent's genome under selective pressure, resulting in substantially more efficient training. In this case, efficiency is the production of superior competitive ability at a lower evolutionary velocity. Prisoner's dilemma playing agents are evolved for 6400 generations, taking samples at eight exponentially spaced epochs. This permits assessment of the change in populations over long evolutionary time. Agents are evaluated for competitive ability between those evolved for different lengths of time and between those evolved using distinct noise levels. The presence of noise during agent training is found to convey a commanding competitive advantage. A novel analysis is done in which a tournament is run with no two agents from the same evolutionary line and one third of agents from each noise level studied. This analysis simulates contributed agent tournaments without any genetic relation between agents. It is found that in early epochs the agents evolved without noise have the best average tournament rank, but that in later epochs they have the worst.

Published in:

IEEE Transactions on Computational Intelligence and AI in Games  (Volume:1 ,  Issue: 2 )