Abstract
The theory of deterministic discrete dynamic programming with discount factorα>1 is further developed. A result is derived that establishes a connection between dynamic programming withα 1. This result, in conjunction with a state classification scheme, yields an efficient algorithm computing an optimal policy. The limiting caseα=1 is also briefly discussed.
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.
