Perceptron versus automaton in the finitely repeated prisoner’s dilemma

Theory and Decision 69 (2):183-204 (2010)
  Copy   BIBTEX

Abstract

We study the finitely repeated prisoner’s dilemma in which the players are restricted to choosing strategies which are implementable by a machine with a bound on its complexity. One player has to use a finite automaton while the other player has to use a finite perceptron. Some examples illustrate that the sets of strategies which are induced by these two types of machines are different and not ordered by set inclusion. Repeated game payoffs are evaluated according to the limit of means. The main result establishes that a cooperation at almost all stages of the game is an equilibrium outcome if the complexity of the machines the players may use is limited enough and if the length T of the repeated game is sufficiently large. This result persists when more than T states are allowed in the player’s automaton. We further consider a variant of the model in which the two players are restricted to choosing strategies which are implementable by perceptrons and prove that the players can cooperate at most of the stages provided that the complexity of their perceptrons is sufficiently reduced

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-12-01

Downloads
38 (#365,484)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references