Abstract
The stopping problem on Markov process with OLA(One-stage Look Ahead) policy is considered. Its associated optimal value could be expressed explicitly by a potential for a charge of the positive part of the difference between the immediate reward and the oneperiod-after reward. As application to the best choice problem, the optimal value of three problems: the classical secretary problem, the problem with a refusal probability and the one with random number of objects are calculated.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
