The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Making new connections towards cooperation in the prisoner's dilemma game
Open accessAbstract
Evolution of cooperation in the prisoner's dilemma game is studied where initially all players are linked via a regular graph, having four neighbors each. Simultaneously with the strategy evolution, players are allowed to make new connections and thus permanently extend their neighborhoods, provided they have been successful in passing their strategy to the opponents. We show that this simple coevolutionary rule shifts the survival barrier of cooperators towards high temptations to defect and results in highly heterogeneous interaction networks with an exponential fit best characterizing their degree distributions. In particular, there exist an optimal maximal degree for the promotion of cooperation, warranting the best exchange of information between influential players.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Axelrod, R., & Hamilton, W. D. (1981) · Science · doi:10.1126/science.7466396 · Cited by 20,065
Nielsen, R. P., & Axelrod, R. (1985) · The Academy of Management Review · doi:10.2307/257983 · Cited by 6,321
Evolutionary games and spatial chaos
Nowak, M. A., & May, R. M. (1992) · Nature · doi:10.1038/359826a0 · Cited by 4,463
Szabó, G., & Fáth, G. (2007) · Physics Reports · doi:10.1016/j.physrep.2007.04.004 · Cited by 2,974
Scale-Free Networks Provide a Unifying Framework for the Emergence of Cooperation
Santos, F. C., & Pacheco, J. M. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.098104 · Cited by 1,804
Evolutionary prisoner’s dilemma game on a square lattice
Szabó, G., & Tőke, C. (1998) · Physical Review E · doi:10.1103/physreve.58.69 · Cited by 1,659
Spatial structure often inhibits the evolution of cooperation in the snowdrift game
Hauert, C., & Doebeli, M. (2004) · Nature · doi:10.1038/nature02360 · Cited by 1,582
Social diversity promotes the emergence of cooperation in public goods games
Santos, F. C., Santos, M. D., & Pacheco, J. M. (2008) · Nature · doi:10.1038/nature06940 · Cited by 1,442
Social diversity and promotion of cooperation in the spatial prisoner’s dilemma game
Perc, M., & Szolnoki, A. (2008) · Physical Review E · doi:10.1103/physreve.77.011904 · Cited by 774
Self-citation
Cited by
Win-Stay-Lose-Learn Promotes Cooperation in the Spatial Prisoner's Dilemma Game
Liu, Y., Chen, X., Zhang, L., Wang, L., & Perc, M. (2012) · PLoS ONE · doi:10.1371/journal.pone.0030689 · Cited by 527
Self-citationEvolution of public cooperation on interdependent networks: The impact of biased utility functions
Wang, Z., Szolnoki, A., & Perc, M. (2012) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/97/48001 · Cited by 354
Self-citationResolving social dilemmas on evolving random networks
Szolnoki, A., & Perc, M. (2009) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/86/30007 · Cited by 293
Self-citationNetworks of reliable reputations and cooperation: a review
Takács, K., Gross, J., Testori, M., Letina, S., Kenny, A. R., Power, E. A., & Wittek, R. P. M. (2021) · Philosophical Transactions of the Royal Society B · doi:10.1098/rstb.2020.0297 · Cited by 61
Costs for switching partners reduce network dynamics but not cooperative behaviour
Bednarik, P., Fehl, K., & Semmann, D. (2014) · Proceedings of the Royal Society B: Biological Sciences · doi:10.1098/rspb.2014.1661 · Cited by 49
Metadata
- Authors
- Szolnoki, A., Perc, M., & Danku, Z.
- Venue
- EPL (Europhysics Letters)
- Publisher
- IOP Publishing
- Published
- 2008-12
- Volume
- 84
- Issue
- 5
- Pages
- 50007
- ISSN
- 0295-5075 (ISSN-L)
- 1286-4854
- OpenAlex
- W1981094067
- Cited by
- 266
- References
- 36
- FWCI
- 82.47
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Making new connections towards cooperation in the prisoner's dilemma game. https://app.cochat.ai/papers/10.1209/0295-5075/84/50007
- The paper
- Szolnoki, A., Perc, M., & Danku, Z. (2008). Making new connections towards cooperation in the prisoner's dilemma game. EPL (Europhysics Letters). https://doi.org/10.1209/0295-5075/84/50007
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.