IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v87y2014icp204-223.html
   My bibliography  Save this article

Learning with bounded memory in games

Author

Listed:
  • Monte, Daniel

Abstract

We study learning with bounded memory in zero-sum repeated games with one-sided incomplete information. The uninformed player has only a fixed number of memory states available. His strategy is to choose a transition rule from state to state, and an action rule, which is a map from each memory state to the set of actions. We show that the equilibrium transition rule involves randomization only in the intermediate memory states. Such randomization, or less frequent updating, is interpreted as a way of testing the opponent, which generates inertia in the player's behavior and is the main short-run bias in information processing exhibited by the bounded memory player.

Suggested Citation

  • Monte, Daniel, 2014. "Learning with bounded memory in games," Games and Economic Behavior, Elsevier, vol. 87(C), pages 204-223.
    • Handle: RePEc:eee:gamebe:v:87:y:2014:i:c:p:204-223
    DOI: 10.1016/j.geb.2014.03.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825614000499
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.geb.2014.03.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kreps, David M. & Milgrom, Paul & Roberts, John & Wilson, Robert, 1982. "Rational cooperation in the finitely repeated prisoners' dilemma," Journal of Economic Theory, Elsevier, vol. 27(2), pages 245-252, August.
    2. Kalai, Ehud & Solan, Eilon, 2003. "Randomization and simplification in dynamic decision-making," Journal of Economic Theory, Elsevier, vol. 111(2), pages 251-264, August.
    3. Martin W. Cripps & George J. Mailath & Larry Samuelson, 2004. "Imperfect Monitoring and Impermanent Reputations," Econometrica, Econometric Society, vol. 72(2), pages 407-432, March.
    4. Piccione, Michele & Rubinstein, Ariel, 1997. "On the Interpretation of Decision Problems with Imperfect Recall," Games and Economic Behavior, Elsevier, vol. 20(1), pages 3-24, July.
    5. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    6. Kalai, E & Neme, A, 1992. "The Strength of a Little Perfection," International Journal of Game Theory, Springer;Game Theory Society, vol. 20(4), pages 335-355.
    7. Aumann, Robert J. & Hart, Sergiu & Perry, Motty, 1997. "The Absent-Minded Driver," Games and Economic Behavior, Elsevier, vol. 20(1), pages 102-116, July.
    8. Joel Sobel, 1985. "A Theory of Credibility," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 52(4), pages 557-573.
    9. Andrea Wilson, 2003. "Bounded Memory and Biases in Information Processing," NajEcon Working Paper Reviews 234936000000000070, www.najecon.org.
    10. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    11. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    12. 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.
    13. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    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. Brocas, Isabelle & Carrillo, Juan D., 2016. "A neuroeconomic theory of memory retrieval," Journal of Economic Behavior & Organization, Elsevier, vol. 130(C), pages 198-205.
    2. Daniel Monte & Maher Said, 2014. "The value of (bounded) memory in a changing world," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(1), pages 59-82, May.
    3. Lorecchio, Caio & Monte, Daniel, 2023. "Bad reputation with simple rating systems," Games and Economic Behavior, Elsevier, vol. 142(C), pages 150-178.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    2. Daniel Monte, 2014. "Incentive constraints in games with bounded memory," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(1), pages 137-143, February.
    3. Jehiel, Philippe, 2005. "Analogy-based expectation equilibrium," Journal of Economic Theory, Elsevier, vol. 123(2), pages 81-104, August.
    4. Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
    5. Spiegler, Ran, 2005. "Testing threats in repeated games," Journal of Economic Theory, Elsevier, vol. 121(2), pages 214-235, April.
    6. Ho, Teck-Hua, 1996. "Finite automata play repeated prisoner's dilemma with information processing costs," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 173-207.
    7. Wichardt, Philipp C., 2010. "Modelling equilibrium play as governed by analogy and limited foresight," Games and Economic Behavior, Elsevier, vol. 70(2), pages 472-487, November.
    8. K. Binmore & L. Samuelson, 2010. "Evolutionary Stability in Repeated Games Played by Finite Automata," Levine's Working Paper Archive 561, David K. Levine.
    9. Lambert, Nicolas S. & Marple, Adrian & Shoham, Yoav, 2019. "On equilibria in games with imperfect recall," Games and Economic Behavior, Elsevier, vol. 113(C), pages 164-185.
    10. Beal, Sylvain & Querou, Nicolas, 2007. "Bounded rationality and repeated network formation," Mathematical Social Sciences, Elsevier, vol. 54(1), pages 71-89, July.
    11. Hernández, Penélope & Urbano, Amparo, 2008. "Codification schemes and finite automata," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
    12. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    13. Compte, Olivier & Postlewaite, Andrew, 2015. "Plausible cooperation," Games and Economic Behavior, Elsevier, vol. 91(C), pages 45-59.
    14. Daniel Monte & Maher Said, 2014. "The value of (bounded) memory in a changing world," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(1), pages 59-82, May.
    15. Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
    16. Olivier Gossner & Penélope Hernández, 2003. "On the Complexity of Coordination," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 127-140, February.
    17. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    18. Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.
    19. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    20. Yuval Salant & Jörg L. Spenkuch, 2021. "Complexity and Choice," CESifo Working Paper Series 9239, CESifo.

    More about this item

    Keywords

    Bounded memory; Incomplete information games; Repeated games;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    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:eee:gamebe:v:87:y:2014:i:c:p:204-223. See general information about how to correct material in RePEc.

    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 bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.