IDEAS home Printed from
   My bibliography  Save this paper

Non-Probabilistic Decision Making with Memory Constraints


  • Vostroknutov, Alexander


In the model of choice, studied in this paper, the decision maker chooses the actions non-probabilistically in each period (Sarin and Vahid, 1999; Sarin, 2000). The action is chosen if it yields the biggest payoff according to the decision maker’s subjective assessment. Decision maker knows nothing about the process that generates the payoffs. If the decision maker remembers only recent payoffs, she converges to the maximin action. If she remembers all past payoffs, the maximal expected payoff action is chosen. These results hold for any possible dynamics of weights and are robust against the mistakes. The estimates of the rate of convergence reveal that in some important cases the convergence to the asymptotic behavior can take extremely long time. The model suggests simple experimental test of the way people memorize past experiences: if any weighted procedure is actually involved, it can possibly generate only two distinct modes of behavior.

Suggested Citation

  • Vostroknutov, Alexander, 2005. "Non-Probabilistic Decision Making with Memory Constraints," MPRA Paper 2653, University Library of Munich, Germany, revised Jul 2007.
  • Handle: RePEc:pra:mprapa:2653

    Download full text from publisher

    File URL:
    File Function: original version
    Download Restriction: no

    References listed on IDEAS

    1. Huck Steffen & Sarin Rajiv, 2004. "Players With Limited Memory," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 4(1), pages 1-27, September.
    2. Sarin, Rajiv, 2000. "Decision Rules with Bounded Memory," Journal of Economic Theory, Elsevier, vol. 90(1), pages 151-160, January.
    3. Sarin, Rajiv & Vahid, Farshid, 1999. "Payoff Assessments without Probabilities: A Simple Dynamic Model of Choice," Games and Economic Behavior, Elsevier, vol. 28(2), pages 294-309, August.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Adaptive learning; constrained memory; bandit problem; non-probabilistic choice;

    JEL classification:

    • C02 - Mathematical and Quantitative Methods - - General - - - Mathematical Economics
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness
    • D81 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Criteria for Decision-Making under Risk and Uncertainty


    Access 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:pra:mprapa:2653. 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: (Joachim Winter). General contact details of provider: .

    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.