There is a large literature in economics and elsewhere on the emergence and evolution of cooperation in the repeated Prisoner’s Dilemma. Recently this literature has expanded to include cooperation in spatial prisoner dilemma games where agents play only with local neighbors in a specified geography. In this paper we explore how the ability of agents to move and choose new locations and new neighbors influences the emergence of cooperation. First, we explore the dynamics of cooperation by investigating agent strategies that yield Markov transition probabilities. We show how different agent strategies yield different Markov chains which generate different asymptotic behaviors in regard to the attainment of cooperation. Second, we investigate how agent movement affects the attainment of cooperation in various spatial networks using agent based simulations.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Find related papers by JEL classification: C63 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Computational Techniques C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games D8 - Microeconomics - - Information, Knowledge, and Uncertainty
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: