Unbounded Behaviorally Consistent Stopping Rules
In 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
To our knowledge, this item is not available for
download. To find whether it is available, there are three
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.
When requesting a correction, please mention this item's handle: RePEc:kap:jrisku:v:9:y:1994:i:3:p:231-38. 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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.