Unbounded Behaviorally Consistent Stopping Rules
AbstractIn this article we study behaviorally consistent stopping rules in an unbounded search from a known distribution with no recall and with positive search cost. We show that if the searcher's preferences are quasi-convex in the probabilities, then behaviorally consistent search strategies in the unbounded case are obtained as limits of the corresponding bounded search strategies and are characterized by reservation levels property. Unlike optimal stopping rules under expected utility theory, however, the reservation levels may not be monotonically increasing in the number of permissible stages of the search process, and, in the unbounded case, may not be unique. Copyright 1994 by Kluwer Academic Publishers
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoArticle provided by Springer in its journal Journal of Risk and Uncertainty.
Volume (Year): 9 (1994)
Issue (Month): 3 (December)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100299
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Muller, Alfred, 2000. "Expected utility maximization of optimal stopping problems," European Journal of Operational Research, Elsevier, vol. 122(1), pages 101-114, April.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.