Abstract
This paper deals with the approximation problem of the first passage models for discrete-time Markov decision processes (MDPs) with varying discount factors. For a given control model M, by using a finite-state and finite-action truncation technique, we show that the first passage optimal reward and policies of M can be approximated by those of the solvable truncated control models, and illustrate the finite approximation by a controlled queueing system in numerical results.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
