The Open UniversitySkip to content

Time and the Prisoner's Dilemma

Mor, Yishay and Rosenschein, Jeffrey S. (1995). Time and the Prisoner's Dilemma. In: First International Conference on Multiagent Systems (ICMAS95), 12-14 June 1995, AAAI Press / MIT Press, pp. 276–282.

Full text available as:
PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (167Kb)
Google Scholar: Look up in Google Scholar


This paper examines the integration of computational complexity into game theoretic models. The example focused on is the Prisoner’s Dilemma, repeated for a finite length of time. We show that a minimal bound on the players’ computational ability is sufficient to enable cooperative behavior.

In addition, a variant of the repeated Prisoner’s Dilemma game is suggested, in which players have the choice of opting out. This modification enriches the game and suggests dominance of cooperative strategies.

Competitive analysis is suggested as a tool for investigating sub-optimal (but computationally tractable) strategies and game theoretic models in general. Using competitive analysis, it is shown that for bounded players, a sub-optimal strategy might be the optimal choice, given resource limitations.

Item Type: Conference Item
Copyright Holders: 1995 American Association for Artificial Intelligence
Keywords: conceptual and theoretical foundations of multiagent systems; prisoner’s dilemma
Academic Unit/Department: Institute of Educational Technology
Interdisciplinary Research Centre: Centre for Research in Education and Educational Technology (CREET)
Related URLs:
Item ID: 30336
Depositing User: Yishay Mor
Date Deposited: 10 Feb 2012 15:16
Last Modified: 07 Feb 2016 09:27
Share this page:

Actions (login may be required)

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340