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

DOI10.2307/3213917MaRDI QIDQ3940573zbMATH OpenOpenAlexFDO

Authors George E. Monahan

Publication date 1982

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3213917

zbMATH Keywords

partially observable Markov decision processesdynamic programmingoptimal stopping in a Markov chain

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)

Cited in

(4)

• The effect of multi-sensor data on condition-based maintenance policies
• Expert-mediated sequential search
• Optimal cost and policy for a Markovian replacement problem
• On the computation of the optimal cost function for discrete time Markov models with partial observations

This page was built for publication: Optimal stopping in a partially observable binary-valued markov chain with costly perfect information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3940573)