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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
