The problem of optimal stopping in a partially observable Markov chain

1985 ◽  
Vol 45 (3) ◽  
pp. 425-442 ◽  
Author(s):  
T. Nakai
Keyword(s):  
Markov Chain ◽  
Optimal Stopping ◽  
Partially Observable Markov ◽  
Partially Observable

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

1982 ◽  
Vol 19 (1) ◽  
pp. 72-81 ◽  
Author(s):  
George E. Monahan
Keyword(s):  
Markov Chain ◽  
Optimal Stopping ◽  
Optimal Policy ◽  
Value Function ◽  
Structural Information ◽  
State Information ◽  
Mild Conditions ◽  
Optimal Value ◽  
Markov Decision ◽  
Partially Observable

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.

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

1982 ◽  
Vol 19 (01) ◽  
pp. 72-81 ◽  
Author(s):  
George E. Monahan
Keyword(s):  
Markov Chain ◽  
Optimal Stopping ◽  
Optimal Policy ◽  
Value Function ◽  
Structural Information ◽  
State Information ◽  
Mild Conditions ◽  
Optimal Value ◽  
Markov Decision ◽  
Partially Observable

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.

Sign in / Sign up

Export Citation Format

Share Document