The Iterated Prisoner’s Dilemma (IPD) has been an effective model of social, biological and political interaction for nearly 40 years. In the traditional definition of the game, constraints are provided that limit the cooperation between players to mutual cooperation , i.e. both players deciding to “cooperate” on a single play. This paper demonstrates that by modifying the traditional constraints, successful strategies must embody the ability to coordinate their interactions over several consecutive plays, a much more complex and potentially more interesting behavior. This form of interaction is termed nonmutual cooperation . This paper demonstrate the evolution of non-mutually cooperative agents, represented as Finite State Machines, under two distinct payoff schemes and discusses the implications of these results.
David B. Fogel,et al.
Evolving Behaviors in the Iterated Prisoner's Dilemma
The evolution of intelligent decision making in gaming
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
Metamagical Themas: Questing for the Essence of Mind and Pattern
W. Hamilton,et al.
The evolution of cooperation.
More Effective Choice in the Prisoner's Dilemma
John H. Holland,et al.
Adaptation in natural and artificial systems
Optimal policies for the Prisoner's Dilemma.
Lawrence J. Fogel,et al.
Artificial Intelligence through Simulated Evolution