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

Ashlock, Daniel; Kim, Eun-Youn; Ashlock, Wendy

doi:10.1109/tciaig.2009.2018704

Cited by 49 publications

(25 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This has enabled previously inattainable studies in representational sensitivity [7], [8], evolutionary time and population size [9], the effect of noise [10], [11] among others.…”

Section: Introductionmentioning

confidence: 99%

The structure of a 3-state finite transducer representation for Prisoner's Dilemma

Tsang

2013

2013 IEEE Conference on Computational Inteligence in Games (CIG)

View full text Add to dashboard Cite

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.

show abstract

“…This has enabled previously inattainable studies in representational sensitivity [7], [8], evolutionary time and population size [9], the effect of noise [10], [11] among others.…”

Section: Introductionmentioning

confidence: 99%

The structure of a 3-state finite transducer representation for Prisoner's Dilemma

Tsang

2013

2013 IEEE Conference on Computational Inteligence in Games (CIG)

View full text Add to dashboard Cite

show abstract

“…In the past studies [11], [9], [3], [4], [6], it was established that when 150 rounds of iterated prisoner's dilemma with the 0, 1, 3, 5 payoff scheme are used in fitness evaluation, an average score of 2.8 signifies that FSMs end up in a cycle of sustained cooperation. We extend this fitness measure in this study, a technique also used in [5].…”

Section: Design Of Experimentsmentioning

confidence: 99%

The impact of connection topology and agent size on cooperation in the iterated prisoner's dilemma

Barlow

Ashlock

2013

2013 IEEE Conference on Computational Inteligence in Games (CIG)

View full text Add to dashboard Cite

Abstract-This study revisits earlier work, concerning the evolutionary trajectory of agents trained to play iterated prisoner's dilemma on a combinatorial graph. The impact of different connection topologies, used to mediate both the play of prisoner's dilemma and the flow of genes during selection and replacement, is examined. The variety of connection topologies, stored as combinatorial graphs, is revisited and the analysis tools used are substantially improved. A novel tool called the play profile summarizes the distribution of behaviors over multiple replicates of the basic evolutionary algorithm and through multiple evolutionary epochs. The impact of changing the number of states used to encode agents is also examined. Changing the combinatorial graph on which the population resides is found to yield statistically significant differences in the play profiles. Changing the number of states in agents is also found to produce statistically significant differences in behavior. The use of multiple epochs in analysis of agent behavior demonstrates that the distribution of behaviors changes substantially over the course of evolution. The most common pattern is for agents to move toward the cooperative state over time, but this pattern is not universal. Another clear trend is that agents implemented with more states are less cooperative.

show abstract

“…This makes the analysis much more tractable, and has led to previously unattainable studies in evolutionary time and population size [4], the effect of noise [5], [6] among others.…”

Section: Introductionmentioning

confidence: 99%

Comparing the structure of probabilistic 4- and 8-state finite transducer representations for Prisoner's Dilemma

Tsang

2014

2014 IEEE Conference on Computational Intelligence and Games

View full text Add to dashboard Cite

The fingerprint is a mathematical tool that turns a game-playing strategy into a representation-independent func tional summary of its behaviour; several studies have used this to enable massive computational analyses of entire spaces of strategies. This study extends further by directly comparing two large (on the order of 1096) state spaces, grids over the probabilistic 4-and 8-state finite transducers, as representations for playing iterated Prisoner's Dilemma. We take uniformly random samples of size 65,536 from each, fingerprint each strategy in both samples, and compute all pairwise distances within each sample. Hierarchical clustering reduces each dis tance matrix to size 16,384 for embedding into Euclidean space with multidimensional scaling. Results indicate that several important dimensions are strongly preserved between the rep resentations, and we can quantify them. We additionally find an important theoretical construct, two strategies that are not identical in behaviour, but with the same fingerprint: Random and periodic (CDDC).

show abstract

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

Cited by 49 publications

References 20 publications

The structure of a 3-state finite transducer representation for Prisoner's Dilemma

The structure of a 3-state finite transducer representation for Prisoner's Dilemma

The impact of connection topology and agent size on cooperation in the iterated prisoner's dilemma

Comparing the structure of probabilistic 4- and 8-state finite transducer representations for Prisoner's Dilemma

Contact Info

Product

Resources

About