Citation:
Neyman A. Bounded Complexity Justifies Cooperation in the Finitely Repeated Prisoner's Dilemma. Economic Letters. 1985;19 :227-229.
 | bounded.pdf | 163 KB |
See also: Repeated games, Repeated games and complexity
Abraham Neyman
Professor of mathematics
Institute of Mathematics, and the Federmann Center for the Study of Rationality
Hebrew University of Jerusalem
By type
- Book Chapters (8)
- Books (3)
- Conference Papers (1)
- Conference Proceedings (1)
- Journal Articles (67)
- Manuscripts (6)
- Miscellaneous (36)
- Presentations (1)
- Reports (1)
- Working Papers (1)
Filter By
Copyright © The Hebrew University of Jerusalem
Developed by Gizra