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 instant.ly and forever unavailable and (2) it remains forever available, called a no recall model and a recall model. respect.ively. The main results obtained here are as follows: 1. Bot.h models have a reservation value property, and the reservation vallles are non decreasing in the number of periods, t, remaining up to deadline and converge as t -+ 00; 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 opt.imal next search area is i, if w. :s tu :s w', then j i= i, and if w' < w, then again i; and 4. Suppose the travel cost is independent. of the start.ing search area. Then, in the recall model, t.he reservat.ion 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 -+ 00.
منابع مشابه
Optimal Stopping Policy for Multivariate Sequences a Generalized Best Choice Problem
In the classical versions of “Best Choice Problem”, the sequence of offers is a random sample from a single known distribution. We present an extension of this problem in which the sequential offers are random variables but from multiple independent distributions. Each distribution function represents a class of investment or offers. Offers appear without any specified order. The objective is...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملRisk Minimization in Optimal Stopping Problem and Applications
We consider an optimal stopping problem with a discrete time stochastic process where a criterion is a threshold probability. We first obtain the fundamental characterization of an optimal value and an optimal stopping time as the result of the classical optimal stopping problem, but the optimal value and the optimal stopping time depend upon a threshold value. We also give the properties of th...
متن کاملGravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs
Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...
متن کاملThe Optimal Stopping Problem in Which the Sum of the Accepted Offer's Value and the Remaining Search Budget Is an Objective Function
The paper deals with an optimal stopping problem with a finite planning horizon where an available search budget, the total amount of money that can be invested in search activities throughout the planning horizon, is limited and where both the probability of an offer being obtained at each point in time and the probability distribution function of an obtained offer's value may depend on the se...
متن کامل