We study a model of local evolution. Players are located on a network and play games agains their neighbors. Players are characterized by three properties: (1) The stage game strategies they use agains their neighbors. (2) The repeated game strategy that determines the former. (3) A learning...

This paper applies the idea of evolution to a spatial model. We assume that prisoners' dilemmas or coordination games are played repeatedly within neighborhoods where players do not optimize but instead copy successful strategies. Discriminatory behavior of players is introduced representing...

We present a simple model of spatial evolution that avoids several problems that arise with more complex networks of players. We consider a world where pairs of players are permanently matched. These players learn from the whole population but they are more likely to learn to strategies used by...

We introduce a generalized theoretical approach to study imitation models and subject the models to rigorous experimental testing. In our theoretical analysis we find that the different predictions of previous imitation models are due to different informational assumptions, not to different...

Consider a large population of individuals that are repeatedly randomly matched to play a cyclic 2x2 game such as Matching Pennies with fixed roles assigned in the game. Some learn by sampling previous play of a finite number of other individuals in the same role. We analyze population dynamics...