Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T01:06:26.673Z Has data issue: false hasContentIssue false

Optimal stopping in a partially observable binary-valued markov chain with costly perfect information

Published online by Cambridge University Press:  14 July 2016

George E. Monahan*
Affiliation:
Georgia Institute of Technology
*
∗ Postal address: College of Management, Georgia Institute of Technology, Atlanta, GA 30332, U.S.A.

Abstract

The problem of optimal stopping in a Markov chain when there is imperfect state information is formulated as a partially observable Markov decision process. Properties of the optimal value function are developed. It is shown that under mild conditions the optimal policy is well structured. An efficient algorithm, which uses the structural information in the computation of the optimal policy, is presented.

Information

Type
Research Paper
Copyright
Copyright © Applied Probability Trust 1982 

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