Abstract
A condition is derived that must be satisfied by a continuous function h: X → X in order to be the optimal policy function of a strictly concave deterministic dynamic programming problem which is defined on the state space X and which has a given discount factor ρ. We use this condition to show that there is no such dynamic programming problem on a one-dimensional state space that generates optimal solutions which are periodic with minimal period three unless the discount rate exceeds 82%. This bound holds uniformly for all strictly concave problems and all period-three-cycles.
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.
