Abstract
This note considers the conditions that have been put on the set of transition matrices of finite state Markov Decision Processes in order to prove the existence of optimal policies, and the convergence of algorithms. It is shown that no two of the nine conditions considered are equivalent.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.