Abstract
The problem of controlling a one-dimensional Markov chain until is leaves a given set C is considered. The optimizer tries to minimize the time spent by the Markov chain inside C. The control variable can take two different values. An exact formula is obtained for the value function, from which the optimal control is deduced.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
