Time and the Prisoner's Dilemma

Details Time and the Prisoner's Dilemma Time and the Prisoner's Dilemma

2007-01-22

arxiv.org/abs/cs/0701139v1

Computer Science

Computer Science and Game Theory

Proceedings of the First International Conference on Multiagent Systems (ICMAS95), : 276-282, 1995

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Time and the Prisoner's Dilemma does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Time and the Prisoner's Dilemma, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Time and the Prisoner's Dilemma will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-516115