Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma

https://doi.org/10.1016/0165-1765(85)90026-6Get rights and content

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.

References (11)

There are more references available in the full text version of this article.

Cited by (0)

∗

I would like to thank Professor Robert J. Aumann for many helpful suggestions.

View full text
Copyright © 1985 Published by Elsevier B.V.