Mean-field approximation for two- and three-person Prisoner’s Dilemmas
Tadeusz Platkowski and
Michal Siwak
Physica A: Statistical Mechanics and its Applications, 2008, vol. 387, issue 12, 2909-2918
Abstract:
We consider the mean-field approximation (MFA) to the system of interacting agents playing two- and three-person Prisoner’s Dilemma games (2-PD and 3-PD). The agents have three available strategies: All-C, All-D, and a third one, which we choose in various ways. Long-time distribution of the strategies is compared for both games. The latter game admits coexistence of larger number of strategies in the long run. In the case of external pressure for cooperation, more pressure is in general necessary for 3-PD than for 2-PD to guarantee cooperation for almost all initial compositions of the strategies. Results for different types of tit-for-tat strategies for 3-PD are discussed. Unlike the 2-PD case, the more forgiving tit-for-tat strategy can survive in the long run in 3-PD.
Keywords: Prisoner’s Dilemma; Cooperation; Mean-field approximation (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437108001234
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:387:y:2008:i:12:p:2909-2918
DOI: 10.1016/j.physa.2008.01.098
Access Statistics for this article
Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis
More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().