Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T09:37:24.994Z Has data issue: false hasContentIssue false

The optimal value of markov stopping problems with one-step look ahead policy

Published online by Cambridge University Press:  14 July 2016

Masami Yasuda*
Affiliation:
Chiba University
*
∗ Postal address: College of General Education, Chiba University, Chiba, 260 Japan.

Abstract

This paper treats stopping problems on Markov chains in which the OLA (one-step look ahead) policy is optimal. Its associated optimal value can be explicitly expressed by a potential for a charge function of the difference between the immediate reward and the one-step-after reward. As an application to the best choice problem, we shall obtain the value of three problems: the classical secretary problem, a problem with a refusal probability and a problem with a random number of objects.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1988 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable