OPTIMAL STOPPING PROBLEM WITH CONTROLLED RECALL

This paper deals with the following discrete-time optimal stopping pro blem. For fixed search cost a a random offer, w similar to F(w), will be found for each time. This offer is either accepted, rejected, or '' reserved'' for recall later The reserving cost for any offer depends o n its value, regardless of how long the offer is reserved. The objecti ve is to maximize the expected discounted net profit, provided that an offer must be accepted. The major finding is that no previously reser ved offer should be accepted prior to the deadline of the search proce ss.