DocumentCode :
1572384
Title :
The structure of a 3-state finite transducer representation for Prisoner´s Dilemma
Author :
Tsang, Jeffrey
Author_Institution :
Dept. of Math. & Stat., Univ. of Guelph, Guelph, ON, Canada
fYear :
2013
Firstpage :
1
Lastpage :
7
Abstract :
To facilitate systematic and automated analysis of game playing strategies, the fingerprint, a mathematical technique that generates a functional summary independent of representation, was developed. This study attempts to push the boundaries of full state space investigation, looking at 3-state finite transducers as a representation for playing Prisoner´s Dilemma. There are a staggering 23,000 unique strategies in this space, which severely limits the choice of analysis methods. These strategies are fingerprinted and pairwise distances computed, then hierarchical clustering reduces them to a manageable size for further experiments with multidimensional scaling and the mutational connectivity network. Results indicate there are no obvious cutoff scales of structure; mutational distance is not correlated with fingerprint distance; and a level of similarity with past results on smaller state spaces.
Keywords :
game theory; pattern clustering; state-space methods; 3-state finite transducer representation structure; fingerprint distance; full state space investigation; functional summary generation; game playing strategy analysis; hierarchical clustering; mathematical technique; multidimensional scaling; mutational connectivity network; mutational distance; pairwise distance; prisoner´s dilemma; Automata; Correlation; Fingerprint recognition; Games; Image color analysis; Measurement; Transducers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence in Games (CIG), 2013 IEEE Conference on
Conference_Location :
Niagara Falls, ON
ISSN :
2325-4270
Print_ISBN :
978-1-4673-5308-3
Type :
conf
DOI :
10.1109/CIG.2013.6633638
Filename :
6633638
Link To Document :
بازگشت