Optimal Search with Learning
Posted: 19 Jun 2005
Abstract
The sequential search problem, without the assumption that the searcher knows the underlying distribution, is investigated. Both search with recall and without recall are examined. Sufficient conditions for the existence of optimal stopping rules with the reservation property are provided. Comparative static results with respect to stochastic dominance (appropriately defined) are obtained.
Keywords: Search, Learning, Information
JEL Classification: D83
Suggested Citation: Suggested Citation
Sharma, Sunil and Bikhchandani, Sushil, Optimal Search with Learning. Available at SSRN: https://ssrn.com/abstract=744065
Do you have negative results from your research you’d like to share?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.