IDEAS home Printed from https://ideas.repec.org/p/cla/levarc/122247000000002427.html
   My bibliography  Save this paper

Learning Effectiveness and Memory Size

Author

Listed:
  • Abraham Neyman

Abstract

No abstract is available for this item.

Suggested Citation

  • Abraham Neyman, 2008. "Learning Effectiveness and Memory Size," Levine's Working Paper Archive 122247000000002427, David K. Levine.
  • Handle: RePEc:cla:levarc:122247000000002427
    as

    Download full text from publisher

    File URL: http://www.dklevine.com/archive/refs4122247000000002427.pdf
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Neyman, Abraham & Okada, Daijiro, 2009. "Growth of strategy sets, entropy, and nonstationary bounded recall," Games and Economic Behavior, Elsevier, vol. 66(1), pages 404-425, May.
    2. Neyman, Abraham & Spencer, Joel, 2010. "Complexity and effective prediction," Games and Economic Behavior, Elsevier, vol. 69(1), pages 165-168, May.
    3. Ron Peretz, 2007. "The Strategic Value of Recall," Discussion Paper Series dp470, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    4. Olivier Gossner & Penélope Hernández & Abraham Neyman, 2006. "Optimal Use of Communication Resources," Econometrica, Econometric Society, vol. 74(6), pages 1603-1636, November.
    5. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    6. Ron Peretz, 2007. "The Strategic Value of Recall," Levine's Bibliography 122247000000001774, UCLA Department of Economics.
    7. 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.
    8. Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
    9. 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.
    10. Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February.
    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


    Cited by:

    1. Neyman, Abraham & Spencer, Joel, 2010. "Complexity and effective prediction," Games and Economic Behavior, Elsevier, vol. 69(1), pages 165-168, May.
    2. Peretz, Ron, 2012. "The strategic value of recall," Games and Economic Behavior, Elsevier, vol. 74(1), pages 332-351.
    3. Bavly, Gilad & Neyman, Abraham, 2014. "Online concealed correlation and bounded rationality," Games and Economic Behavior, Elsevier, vol. 88(C), pages 71-89.
    4. Ron Peretz, 2010. "Learning Cycle Length through Finite Automata," Discussion Paper Series dp546, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    5. Ron Peretz, 2011. "Correlation through Bounded Recall Strategies," Discussion Paper Series dp579, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    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:cla:levarc:122247000000002427. 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: (David K. Levine). General contact details of provider: http://www.dklevine.com/ .

    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 CitEc recognized a reference but did not link an item in RePEc 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 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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.