Work

Optimal search on spatial paths with recall, Part II: Computational procedures and examples

Year: 2000

Type: article

Abstract: . This is the second part of a two-part analysis of optimal spatial search begun in Harwitz et al. (1998). In the present article, two explicit computational procedures are developed for the optimal spatial search problem studied in Part I. The first uses reservation prices with continuous known distributions of prices and is illustrated for three stores. The second does not use reservation prices but assumes known discrete distributions. It is a numerical approximation to the first and also a tool for examining examples with larger numbers of stores.

Source: Papers of the Regional Science Association

DOI: 10.1007/pl00013612

Authors: Mitchell Harwitz, Barry Lentnek, Peter Rogerson, T.E. Smith

Institutions: University at Buffalo, State University of New York, University of Pennsylvania

Language: English

Topic: Optimization and Search Problems

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,740

OpenAlex ID: W2082220111

FWCI: 0.516

Cites: 8

Cited by: 3

Related to: 10