Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma (Q373811)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma |
scientific article; zbMATH DE number 6219611
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma |
scientific article; zbMATH DE number 6219611 |
Statements
Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma (English)
0 references
25 October 2013
0 references
0.9291115
0 references
0.91794837
0 references
0.89623404
0 references
0.89325607
0 references
0.8930954
0 references
0.89140457
0 references
0 references
0.8851751
0 references
