IDEAS home Printed from
   My bibliography  Save this article

Case-Based Optimization


  • Gilboa, Itzhak
  • Schmeidler, David


Case-based Decision Theory (CBDT) suggests that decisions under ucnertainty are made by analogies to previously-encountered problems. The theory postulates a similarity function over decision problems and a utility functionon outcomes, such that acts are evaluated by a similarity-weighted sum of the utility othey yielded in past cases in which they were chosen. It gives rise to the concept of "aspiration level" in the following sense: if this level is attained by some acts, the decision will only choose among them, and will not even experiment withothers. Thus a case-based decision maker may be "satisficed" with a choice, and will not maximize his/her utility function even if the "same" problem is encountered over and over again. In this paper we discuss the process by which the aspiration level is updated. An adjustment rule is "realistic" if the aspiration level is (almost always) set to be an average of its previous value and the best average-performance so far encountered. It is "ambitious" if at least one of the following holds: (i) the initial aspiration level is set at a high level, or (ii) the aspiration level is set to exceed the maximal average performance by some constant infinitely often. While we propose realistic-but-ambitious adjustment rules for decision under uncertainty at large, we focus here on the case in which the decision maker is repeatedly faced with the "same" problem, assuming that each choice yields an independent realization of a given random variable. We show that if the adjustment rule is realistic-but-ambitious in the sense of (i), then with arbitrarily high probability the decision maker will asymptotically choose only expected-utility maximizing acts. Ambitiousess in the sense of (ii) above guarantees the same result with probability 1, and for all underlying payoff distributions. Hence, case-based decision makers who are both ambitious and realistic will "learn"
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Gilboa, Itzhak & Schmeidler, David, 1996. "Case-Based Optimization," Games and Economic Behavior, Elsevier, vol. 15(1), pages 1-26, July.
  • Handle: RePEc:eee:gamebe:v:15:y:1996:i:1:p:1-26

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

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

    Other versions of this item:

    References listed on IDEAS

    1. Itzhak Gilboa & David Schmeidler, 1995. "Case-Based Decision Theory," The Quarterly Journal of Economics, Oxford University Press, vol. 110(3), pages 605-639.
    2. Kandori, Michihiro & Mailath, George J & Rob, Rafael, 1993. "Learning, Mutation, and Long Run Equilibria in Games," Econometrica, Econometric Society, vol. 61(1), pages 29-56, January.
    3. Itzhak Gilboa & David Schmeidler, 1993. "Case-Based Consumer Theory," Discussion Papers 1025, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    Full references (including those not matched with items on IDEAS)

    More about this item


    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:eee:gamebe:v:15:y:1996:i:1:p:1-26. 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: (Dana Niculescu). 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.