Optimal Search with Learning

Posted: 19 Jun 2005

See all articles by Sunil Sharma

Sunil Sharma

George Washington University - Elliott School of International Affairs

Sushil Bikhchandani

University of California, Los Angeles - Anderson School of Management

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

Sharma, Sunil and Bikhchandani, Sushil, Optimal Search with Learning. Available at SSRN: https://ssrn.com/abstract=744065

Sunil Sharma (Contact Author)

George Washington University - Elliott School of International Affairs ( email )

Institute for International Economic Policy
1957 E Street NW
Washington, DC 20052
United States

Sushil Bikhchandani

University of California, Los Angeles - Anderson School of Management ( email )

110 Westwood Plaza
Los Angeles, CA 90095
United States
310-206-2686 (Phone)
310-825-1581 (Fax)

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Abstract Views
553
PlumX Metrics