Article contents
Adaptive approach to some stopping problems
Published online by Cambridge University Press: 14 July 2016
Abstract
This paper mainly considers the adaptive version of two typical stopping problems, i.e., the parking problem and the secretary problem with refusal. In the first problem, while driving towards a destination, we observe the successive parking places and note whether or not they are occupied. Unoccupied spaces are assumed to occur independently, with probability p. The second problem is to select the best applicant from a population, where each applicant refuses an offer with probability 1 – p. We assume beta prior for p in advance. As time progresses, we update our belief for p in a Bayesian manner based on the observed states of the process. We derive several monotonicity properties of the value function and characterize the optimal strategy in either problem. We also attempt to relax the same probability condition in the classical parking problem.
Keywords
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1985
References
- 4
- Cited by