Bounded Rationality, Neural Network and Folk Theorem in Repeated Games with Discounting
The perfect folk theorem (Fudenberg and Maskin, 1986) need not rely on excessively complex strategies. We recover the perfect folk theorem for two person repeated games with discounting through neural networks (Hopfield, 1982) that have finitely many associative units. For any individually rational payoff vector, we need neural networks with at most seven associative units, each of which can handle only elementary calculations such as maximum, minimum or threshold operation. The uniform upper bound of the complexity of equilibrium strategies differentiates this paper from Ben-Porath and Peleg (1987) in which we need to admit ever more complex strategies in order to expand the set of equilibrium outcomes.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Volume (Year): 4 (1994)
Issue (Month): 6 (October)
|Contact details of provider:|| Web page: http://link.springer.de/link/service/journals/00199/index.htm|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:4:y:1994:i:6:p:935-57. 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 references are entirely missing, you can add them using this form.