OPTIMAL STOPPING PROBLEM WITH SEVERAL SEARCH AREAS

スポンサーリンク

概要

• 論文の詳細を見る

• The present paper deals with an optimal stopping problem with several possible search areas in which travel costs are assumed among the areas. In terms of the future availability of an offer once obtained and passed up, the following two cases are considered: (1) it becomes instantly and forever unavailable and (2) it remains forever available, called a no recall model and a recall model, respectively. The main results obtained here are as follows: 1 . Both models have a reservation value property, and the reservation values are nondecreasing in the number of periods, t, remaining up to deadline and converge as t → ∞; 2. Their limits in both models do not always become the same, which coincide in conventional optimal stopping problems; 3. In the recall model, there may exist double critical points w_* and w*(w_* < w*) in terms of the present offer w in the sense that, if w < w_*, then the optimal next search area. is i, if w_* < w < w*, then j ≠ i, and if w* < w, then again i; and 4. Suppose the travel cost is independent, of the starting search area. Then, in the recall model, the reservation value is independent, of both the remaining periods and the current search area. Furthermore, in this case, the reservation values in both models converge to the same value as t → ∞.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Ikuta Seizo

  Institute Of Socio-economics Planning University Of Tsukuba

• Ikuta Seizo

  Institute of Socio-Economic Planning, University of Tsukuba

関連論文

• OPTIMAL STOPPING PROBLEM WITH SEVERAL SEARCH AREAS
• THE OPTIMAL STOPPING PROBLEM IN WHICH THE SUM OF THE ACCEPTED OFFER'S VALUE AND THE REMAINING SEARCH BUDGET IS AN OBJECTIVE FUNCTION

スポンサーリンク