Abstract
ABSTRACTOptimal strategies are known for the finite and infinite horizon discrete-time search with constant unit cost and without recall. These strategies were obtained in the theory of optimal stopping, based on the martingale convergence theorem and other tools from probability theory. We present here an elementary approach to these problems, relying only on routine calculation of expected values. In the finite horizon case, the solution utilizes a simple form of backward induction, in conjunction with a nonlinear dynamical system, to compute the parameters of the optimal strategy. An elementary proof is also given that a simple threshold search is optimal among all strategies with finite expected total cost.
Published Version
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 call