Advanced Search
MyIDEAS: Login to save this article or follow this journal

Perceptron versus automaton in the finitely repeated prisoner’s dilemma

Contents:

Author Info

  • Sylvain Béal

    ()

Abstract

No abstract is available for this item.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://hdl.handle.net/10.1007/s11238-009-9158-y
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Springer in its journal Theory and Decision.

Volume (Year): 69 (2010)
Issue (Month): 2 (August)
Pages: 183-204

as in new window
Handle: RePEc:kap:theord:v:69:y:2010:i:2:p:183-204

Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100341

Related research

Keywords: Prisoner’s dilemma; Finitely repeated games; Machine games; Automaton; Perceptron; Bounded complexity; Information processing;

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Maria Giovanna Devetag & Massimo Warglien, 2002. "Games and phone numbers: do short term memory bounds affect strategic behavior?," CEEL Working Papers 0211, Cognitive and Experimental Economics Laboratory, Department of Economics, University of Trento, Italia.
  2. Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  3. Fudenberg, Drew & Maskin, Eric, 1986. "The Folk Theorem in Repeated Games with Discounting or with Incomplete Information," Econometrica, Econometric Society, vol. 54(3), pages 533-54, May.
  4. Jim Engle-Warnick & Robert Slonim, 2006. "Inferring repeated-game strategies from actions: evidence from trust game experiments," Economic Theory, Springer, vol. 28(3), pages 603-632, 08.
  5. Gilboa, Itzhak & Samet, Dov, 1989. "Bounded versus unbounded rationality: The tyranny of the weak," Games and Economic Behavior, Elsevier, vol. 1(3), pages 213-221, September.
  6. Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer, vol. 29(3), pages 309-325.
  7. Cho, In-Koo, 1996. "Perceptrons Play Repeated Games with Imperfect Monitoring," Games and Economic Behavior, Elsevier, vol. 16(1), pages 22-53, September.
  8. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
  9. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  10. Cho, In-Koo, 1996. "On the Complexity of Repeated Principal Agent Games," Economic Theory, Springer, vol. 7(1), pages 1-17, January.
  11. Rubenstein, A., 1991. "On Price Recognition and Computational Complexity in a Monopolistic Model," Papers 35-91, Tel Aviv.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Duffy, Sean & Smith, John, 2012. "Cognitive load in the multi-player prisoner's dilemma game: Are there brains in games?," MPRA Paper 38825, University Library of Munich, Germany.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:kap:theord:v:69:y:2010:i:2:p:183-204. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.