The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Algebra of Assortative Encounters and the Evolution of Cooperation
Abstract
This paper explores the way in which assortative matching can maintain cooperative behavior under evolutionary dynamics. If encounters are random, then in Prisoner's Dilemma games, defectors necessarily get higher payoffs than cooperators and thus will eventually prevail. But if matching is assortative, the cost of cooperating may be repaid by higher probabilities of playing against a cooperating opponent. This paper shows that a simple index of assortativity allows a unifying treatment of the evolutionary dynamics in a wide variety of models of social encounters.
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
The genetical evolution of social behaviour. I
Hamilton, W. D. (1964) · Journal of Theoretical Biology · doi:10.1016/0022-5193(64)90038-4 · Cited by 15,725
Cited by
Homo Moralis--Preference Evolution Under Incomplete Information and Assortative Matching
(2013) · Econometrica · doi:10.3982/ecta10637 · Cited by 371
Evolution of parochial altruism by multilevel selection
García, J., & van den Bergh, J. C. J. M. (2011) · Evolution and Human Behavior · doi:10.1016/j.evolhumbehav.2010.07.007 · Cited by 120
Evolution of cooperation with asymmetric social interactions
Su, Q., Allen, B., & Plotkin, J. B. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2113468118 · Cited by 104
Metadata
- Authors
- Bergstrom, T. C.
- Venue
- International Game Theory Review
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2003-09
- Volume
- 05
- Issue
- 03
- Pages
- 211-228
- ISSN
- 0219-1989 (ISSN-L)
- 1793-6675
- OpenAlex
- W2138750606
- Cited by
- 190
- References
- 1
- FWCI
- 17.99
- Type
- journal article
- Language
- en
- Open access
- closed
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: The Algebra of Assortative Encounters and the Evolution of Cooperation. https://app.cochat.ai/papers/10.1142/s0219198903001021
- The paper
- Bergstrom, T. C. (2003). The Algebra of Assortative Encounters and the Evolution of Cooperation. International Game Theory Review. https://doi.org/10.1142/s0219198903001021
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.