Spatial snowdrift game with myopic agents
We have studied a spatially extended snowdrift game, in which the players are located on the sites of two-dimensional square lattices and repeatedly have to choose one of the two strategies, either cooperation (C) or defection (D). A player interacts with its nearest neighbors only, and aims at playing a strategy which maximizes its instant pay-off, assuming that the neighboring agents retain their strategies. If a player is not content with its current strategy, it will change it to the opposite one with probability p next round. Here we show through simulations and analytical approach that these rules result in cooperation levels, which differ to large extent from those obtained using the replicator dynamics. Copyright EDP Sciences/Società Italiana di Fisica/Springer-Verlag 2005
If you experience problems downloading a file, check if you have the proper application to view it first. 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 44 (2005)
Issue (Month): 1 (03)
|Contact details of provider:|| Web page: http://www.springer.com|
Web page: http://publications.edpsciences.org/
|Order Information:||Web: http://www.springer.com/economics/journal/10051|
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.:
- Fudenberg, Drew & Levine, David, 1998.
"Learning in games,"
European Economic Review,
Elsevier, vol. 42(3-5), pages 631-639, May.
- Drew Fudenberg & David K. Levine, 1998. "Learning in Games," Levine's Working Paper Archive 2222, David K. Levine.
- Drew Fudenberg & David M. Kreps & Eric S. Maskin, 1990. "Repeated Games with Long-run and Short-run Players," Review of Economic Studies, Oxford University Press, vol. 57(4), pages 555-573.
- Drew Fudenberg & David Kreps & Eric Maskin, 1988. "Repeated Games with Long-Run and Short-Run Players," Working papers 474, Massachusetts Institute of Technology (MIT), Department of Economics.
- Maskin, Eric & Kreps, David & Fudenberg, Drew, 1990. "Repeated Games with Long-run and Short-run Players," Scholarly Articles 3226950, Harvard University Department of Economics.
- D. Fudenberg & D. M. Kreps & E. Maskin, 1998. "Repeated Games with Long-run and Short-run Players," Levine's Working Paper Archive 608, David K. Levine.
- Drew Fudenberg & Eric Maskin, 1998. "The Folk Theorem for Repeated Games with Discounting and Incomplete Information," Levine's Working Paper Archive 224, David K. Levine. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:44:y:2005:i:1:p:129-135. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.