This paper proposes an aspiration-based dynamic model for cooperation where a large population of agents are matched afresh every period to play a Prisoner's Dilemma. At each point in time, agents hold a common aspiration level which is updated on the basis of some "population statistic", i.e. a...

This paper proposes an aspiration-based model for (anonymous) cooperation where a large population of agents are re-matched every period to playa Prisoner's Dilemma. At each point in time, agents hold a certain common aspiration level which is updated on the basis of population-average...