OPTIMAL SEARCH ON SPATIAL PATHS WITH RECALL: THEORETICAL FOUNDATIONS

Mitchell Harwitz, Barry Lentnek, Peter Rogerson and T.E. Smith

Papers in Regional Science, 1998, vol. 77, issue 3, 301-327

Abstract: ABSTRACT This is the first of two articles which analyzes the problem of organizing an optimal sequential search among sites located in space. Here it is assumed that the payoffs or costs at sites are independent random variables with known distributions, and that recall of previously inspected sites is possible. Optimal sequential search is then taken to include optimization with respect to both stopping rules and search paths. In this article, it is shown that such optima always exist, and that under mild regularity conditions, optimal stopping rules on search paths always exhibit the classical reservation price property. In a companion article, a computational procedure for the optimization problem with continuous distributions is developed. It is illustrated for small examples, and optimal search paths are also computed for examples with discrete contributions.

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1111/j.1435-5597.1998.tb00719.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:presci:v:77:y:1998:i:3:p:301-327

Access Statistics for this article

Papers in Regional Science is currently edited by Jouke van Dijk

More articles in Papers in Regional Science from Wiley Blackwell
Bibliographic data for series maintained by Wiley Content Delivery ().