Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma

Abraham Neyman*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

222 Scopus citations

Abstract

Cooperation in the finitely repeated prisoner's dilemma is justified, without departure from strict utility maximization or complete information, but under the assumption that there are bounds (possibly very large) to the complexity of the strategies that the players may use.

Original languageEnglish
Pages (from-to)227-229
Number of pages3
JournalEconomics Letters
Volume19
Issue number3
DOIs
StatePublished - 1985

Fingerprint

Dive into the research topics of 'Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma'. Together they form a unique fingerprint.

Cite this