Perceptron versus automaton in the finitely repeated prisoner’s dilemma

Sylvain Béal

Theory and Decision, 2010, vol. 69, issue 2, 183-204

Keywords: Prisoner’s dilemma; Finitely repeated games; Machine games; Automaton; Perceptron; Bounded complexity; Information processing (search for similar items in EconPapers)
Date: 2010
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s11238-009-9158-y (text/html)
Access to full text is restricted to subscribers.

Related works:
Working Paper: Perceptron versus Automaton in the Finitely Repeated Prisoner's Dilemma (2010)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:kap:theord:v:69:y:2010:i:2:p:183-204

Ordering information: This journal article can be ordered from
http://www.springer. ... ry/journal/11238/PS2

DOI: 10.1007/s11238-009-9158-y

Access Statistics for this article

Theory and Decision is currently edited by Mohammed Abdellaoui

More articles in Theory and Decision from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().