Sciweavers

9 search results - page 1 / 2
» On Evolving Fixed Pattern Strategies for Iterated Prisoner's...
Sort
View
ACSC
2004
IEEE
13 years 7 months ago
On Evolving Fixed Pattern Strategies for Iterated Prisoner's Dilemma
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
Daniel Jang, Peter A. Whigham, Grant Dick
CEC
2005
IEEE
13 years 5 months ago
Population based incremental learning with guided mutation versus genetic algorithms: iterated prisoners dilemma
Axelrod’s original 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 P...
Timothy Gosling, Nanlin Jin, Edward P. K. Tsang
ATAL
2008
Springer
13 years 5 months ago
Social reward shaping in the prisoner's dilemma
Reward shaping is a well-known technique applied to help reinforcement-learning agents converge more quickly to nearoptimal behavior. In this paper, we introduce social reward sha...
Monica Babes, Enrique Munoz de Cote, Michael L. Li...
TEC
2008
127views more  TEC 2008»
13 years 3 months ago
Fingerprinting: Visualization and Automatic Analysis of Prisoner's Dilemma Strategies
Fingerprinting is a technique for generating a representation-independent functional signature for a game playing agent. Fingerprints can be used to compare agents across represent...
Daniel A. Ashlock, Eun-Youn Kim
CEC
2007
IEEE
13 years 10 months ago
Fingerprint analysis of the noisy prisoner's dilemma
Abstract— Fingerprinting is a technique that permits automatic classification of strategies for playing a game. In this study the evolution of strategies for playing the iterate...
Daniel A. Ashlock, Eun-Youn Kim, Wendy Ashlock