Bounded Computational Capacity Equilibrium
Download full text from publisher
Other versions of this item:
References listed on IDEAS
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Piccione, Michele, 1992. "Finite automata equilibria with discounting," Journal of Economic Theory, Elsevier, vol. 56(1), pages 180-193, February.
- Piccione Michele & Rubinstein Ariel, 1993. "Finite Automata Play a Repeated Extensive Game," Journal of Economic Theory, Elsevier, vol. 61(1), pages 160-168, October.
- Banks, Jeffrey S. & Sundaram, Rangarajan K., 1990. "Repeated games, finite automata, and complexity," Games and Economic Behavior, Elsevier, vol. 2(2), pages 97-117, June.
- Douglas Gale & Hamid Sabourian, 2005. "Complexity and Competition," Econometrica, Econometric Society, vol. 73(3), pages 739-769, May.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Neyman, Abraham & Okada, Daijiro, 1999. "Strategic Entropy and Complexity in Repeated Games," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 191-223, October.
- Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(3), pages 309-325.
- Kalyan Chatterjee & Hamid Sabourian, 2000. "Multiperson Bargaining and Strategic Complexity," Econometrica, Econometric Society, vol. 68(6), pages 1491-1510, November.
- Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February.
- Zemel, Eitan, 1989. "Small talk and cooperation: A note on bounded rationality," Journal of Economic Theory, Elsevier, vol. 49(1), pages 1-9, October.
- Maenner, Eliot, 2008. "Adaptation and complexity in repeated games," Games and Economic Behavior, Elsevier, vol. 63(1), pages 166-187, May.
More about this item
KeywordsBounded rationality; automata; complexity; infnitely repeated games; equilibrium.;
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2014-05-24 (All new papers)
- NEP-EVO-2014-05-24 (Evolutionary Economics)
- NEP-MIC-2014-05-24 (Microeconomics)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:dbe:wpaper:0314. 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: (Emilio Calvo Ramón). General contact details of provider: http://edirc.repec.org/data/ericees.html .
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 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 RePEc Author Service 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.