The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Time and the Prisoner's Dilemma
[article]
2007
arXiv
pre-print
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
arXiv:cs/0701139v1
fatcat:mmrnw7lfffhcpb7jq2nw6ibqnm