Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Large language models instantiate evolutionarily robust strategies of cooperation

Pal, Saptarshi, Mallela, Abhishek, Pracher, Lenz, Wei, Chiyu, Fu, Feng, Schnell, Santiago, Nowak, Martin A·2026·PNAS Nexus

Abstract

Large language models (LLMs) are increasingly deployed to support human decision-making. This use of LLMs has concerning implications, especially when their prescriptions affect the welfare of others. To gauge how LLMs make social decisions, we explore whether five leading models produce sensible strategies in the repeated prisoner’s dilemma, which is the main metaphor of reciprocal cooperation. First, we measure the propensity of LLMs to cooperate in a neutral setting, without using language reminiscent of how this game is usually presented. We record to what extent LLMs implement Nash equilibria or other well-known strategy classes. Thereafter, we explore how LLMs adapt their strategies to changes in parameter values. We vary the game’s stopping probability, the payoff values, and if the total number of rounds is commonly known. We also study the effect of different framings. In each case, we test whether the adaptations of the LLMs are in line with basic intuition, theoretical predictions of evolutionary game theory, and experimental evidence of human participants. While all LLMs perform well in many of the tasks, none of them exhibit full consistency over all tasks. We also conduct tournaments between the inferred LLM strategies and study direct interaction between LLMs in games over ten rounds with known or unknown last round. Our experiments shed light on how current LLMs instantiate reciprocal cooperation.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/pnasnexus/pgag210

Cites

6 of 6 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 54

  1. Thirunavukarasu, 2023, Large language models in medicine, Nat Med, 29, 1930, 10.1038/s41591-023-02448-8 · DOI · Paper page
  2. Schoenegger, 2025, AI-augmented predictions: LLM assistants improve human forecasting accuracy, ACM Trans Interact Intell Syst, 15, 1, 10.1145/3707649 · DOI
  3. Crandall, 2011, Learning to compete, coordinate, and cooperate in repeated games using reinforcement learning, Mach Learn, 82, 281, 10.1007/s10994-010-5192-9 · DOI
  4. Terrucha, 2025, Humans program artificial delegates to accurately solve collective-risk dilemmas but lack precision, Proc Natl Acad Sci U S A, 122, e2319942121, 10.1073/pnas.2319942121 · DOI
  5. Santos, 2024, Prosocial dynamics in multiagent systems, AI Mag, 45, 131
  6. Powers, 2024, The stuff we swim in: regulation alone will not lead to justifiable trust in AI, IEEE Technol Soc Mag, 42, 95, 10.1109/MTS.2023.3341463 · DOI
  7. Hardin, 1968, The tragedy of the commons: the population problem has no technical solution; it requires a fundamental extension in morality, Science, 162, 1243, 10.1126/science.162.3859.1243 · DOI · Paper page
  8. Kerr, 2004, What is altruism?, Trends Ecol Evol, 19, 135, 10.1016/j.tree.2003.10.004 · DOI
  9. Nowak, 2006, Five rules for the evolution of cooperation, Science, 314, 1560, 10.1126/science.1133755 · DOI · Paper page
  10. Rand, 2013, Human cooperation, Trends Cogn Sci, 17, 413, 10.1016/j.tics.2013.06.003 · DOI · Paper page
  11. Frank, 2018, Detecting reciprocity at a global scale, Sci Adv, 4, eaao5348, 10.1126/sciadv.aao5348 · DOI
  12. Van Lange, 2013, The psychology of social dilemmas: a review, Organ Behav Hum Decis Process, 120, 125, 10.1016/j.obhdp.2012.11.003 · DOI
  13. Rapoport, 1966, The game of chicken, Am Behav Sci, 10, 10, 10.1177/000276426601000303 · DOI · Paper page
  14. Trivers, 1971, The evolution of reciprocal altruism, Q Rev Biol, 46, 35, 10.1086/406755 · DOI · Paper page
  15. Axelrod, 1980, Effective choice in the Prisoner’s dilemma, J Confl Res, 24, 3, 10.1177/002200278002400101 · DOI
  16. Nash, 1950, Equilibrium points in n-person games, Proc Natl Acad Sci U S A, 36, 48, 10.1073/pnas.36.1.48 · DOI · Paper page
  17. Fudenberg, 1986, The folk theorem in repeated games with discounting or with incomplete information, Econometrica, 54, 533, 10.2307/1911307 · DOI · Paper page
  18. Axelrod, 1981, The evolution of cooperation, Science, 211, 1390, 10.1126/science.7466396 · DOI · Paper page
  19. Nowak, 1993, Chaos and the evolution of cooperation, Proc Natl Acad Sci U S A, 90, 5091, 10.1073/pnas.90.11.5091 · DOI
  20. Nowak, 1992, Tit for tat in heterogeneous populations, Nature, 355, 250, 10.1038/355250a0 · DOI · Paper page
  21. Van Veelen, 2012, Direct reciprocity in structured populations, Proc Natl Acad Sci U S A, 109, 9929, 10.1073/pnas.1206694109 · DOI · Paper page
  22. Press, 2012, Iterated Prisoner’s Dilemma contains strategies that dominate any evolutionary opponent, Proc Natl Acad Sci U S A, 109, 10409, 10.1073/pnas.1206569109 · DOI · Paper page
  23. Murase, 2020, Five rules for friendly rivalry in direct reciprocity, Sci Rep, 10, 16904, 10.1038/s41598-020-73855-x · DOI
  24. Hilbe, 2017, Memory-n strategies of direct reciprocity, Proc Natl Acad Sci U S A, 114, 4715, 10.1073/pnas.1621239114 · DOI
  25. Glynatsi, 2024, Conditional cooperation with longer memory, Proc Natl Acad Sci U S A, 121, e2420125121, 10.1073/pnas.2420125121 · DOI
  26. Stewart, 2013, From extortion to generosity, evolution in the iterated prisoner’s dilemma, Proc Natl Acad Sci U S A, 110, 15348, 10.1073/pnas.1306246110 · DOI · Paper page
  27. García, 2018, No strategy can win in the repeated prisoner’s dilemma: linking game theory and computer simulations, Front Robot AI, 5, 102, 10.3389/frobt.2018.00102 · DOI
  28. Glynatsi, 2021, A bibliometric study of research topics, collaboration and centrality in the field of the Iterated Prisoner’s Dilemma, Humanit Soc Sci Commun, 8, 45, 10.1057/s41599-021-00718-9 · DOI
  29. Rossetti, 2024, Direct reciprocity among humans, Ethology, 130, e13407, 10.1111/eth.13407 · DOI
  30. Dal Bó, 2019, Strategy choice in the infinitely repeated Prisoner’s Dilemma, Am Econ Rev, 109, 3929, 10.1257/aer.20181480 · DOI
  31. Zagorsky, 2013, Forgiver triumphs in alternating Prisoner’s Dilemma, PLoS One, 8, e80814, 10.1371/journal.pone.0080814 · DOI
  32. Frean, 1994, The Prisoner’s Dilemma without synchrony, Proc R Soc Lond B Biol Sci, 257, 75, 10.1098/rspb.1994.0096 · DOI
  33. Akata, 2025, Playing repeated games with large language models, Nat Hum Behav, 00, 1
  34. Suzuki, 2024, An evolutionary model of personality traits related to cooperative behavior using a large language model, Sci Rep, 14, 5989, 10.1038/s41598-024-55903-y · DOI
  35. Phelps, 2025, The machine psychology of cooperation: can GPT models operationalize prompts for altruism, cooperation, competitiveness, and selfishness in economic games, J Phys Complex, 6, 015018, 10.1088/2632-072X/ada711 · DOI · Paper page
  36. Fudenberg, 1991, Game theory
  37. Hilbe, 2015, Partners or rivals? Strategies for the iterated Prisoner’s Dilemma, Games Econ Behav, 92, 41, 10.1016/j.geb.2015.05.005 · DOI
  38. Hilbe, 2018, Partners and rivals in direct reciprocity, Nat Hum Behav, 2, 469, 10.1038/s41562-018-0320-9 · DOI
  39. Stewart, 2014, Collapse of cooperation in evolving games, Proc Natl Acad Sci U S A, 111, 17558, 10.1073/pnas.1408618111 · DOI
  40. LaPorte, 2026, From simultaneous to leader–follower play in direct reciprocity, PNAS Nexus, 5, pgag005, 10.1093/pnasnexus/pgag005 · DOI
  41. Mao, 2017, Resilient cooperators stabilize long-run cooperation in the finitely repeated Prisoner’s Dilemma, Nat Commun, 8, 13800, 10.1038/ncomms13800 · DOI
  42. Dal-Bó, 2018, On the determinants of cooperation in infinitely repeated games: a survey, J Econ Lit, 56, 60, 10.1257/jel.20160980 · DOI · Paper page
  43. Glynatsi, 2024, Properties of winning iterated Prisoner’s Dilemma strategies, PLoS Comput Biol, 20, e1012644, 10.1371/journal.pcbi.1012644 · DOI
  44. Molander, 1985, The optimal level of generosity in a selfish, uncertain environment, J Confl Res, 29, 611, 10.1177/0022002785029004004 · DOI
  45. Nowak, 1990, The evolution of stochastic strategies in the Prisoner’s Dilemma, Acta Appl Math, 20, 247, 10.1007/BF00049570 · DOI · Paper page
  46. Hauert, 1997, Effects of increasing the number of players and memory size in the iterated Prisoner’s Dilemma: a numerical approach, Proc Biol Sci, 264, 513, 10.1098/rspb.1997.0073 · DOI
  47. Murase, 2023, Grouping promotes both partnership and rivalry with long memory in direct reciprocity, PLoS Comput Biol, 19, e1011228, 10.1371/journal.pcbi.1011228 · DOI
  48. Boyd, 1987, No pure strategy is evolutionarily stable in the repeated Prisoner’s Dilemma game, Nature, 327, 58, 10.1038/327058a0 · DOI · Paper page
  49. Do Yi, 2017, Combination with anti-tit-for-tat remedies problems of tit-for-tat, J Theor Biol, 412, 1
  50. Embrey, 2018, Cooperation in the finitely repeated Prisoner’s Dilemma, Q J Econ, 133, 509, 10.1093/qje/qjx033 · DOI
  51. van den Berg, 2015, Focus on the success of others leads to selfish behavior, Proc Natl Acad Sci U S A, 112, 2912, 10.1073/pnas.1417203112 · DOI
  52. Buscemi, 10.3233/FAIA251300 · DOI
  53. Duan, 2024, Gtbench: uncovering the strategic reasoning capabilities of LLMs via game-theoretic evaluations, Adv Neural Inf Process Syst, 37, 28219, 10.52202/079017-0885 · DOI · Paper page
  54. Levínskỳ, 2020, Should I remember more than you? Best responses to factored strategies, Int J Game Theory, 49, 1105, 10.1007/s00182-020-00733-1 · DOI

Metadata

Authors
Pal, S., Mallela, A., Pracher, L., Wei, C., Fu, F., Schnell, S., & Nowak, M. A.
Venue
PNAS Nexus
Published
2026-05-30
Volume
5
Issue
6
ISSN
2752-6542
Cited by
1
References
6
Language
en
Funders
Dartmouth College

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

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.