Abstract
Many recent dynamic programming specifications fail to satisfy traditional contractivity conditions, which are a cornerstone of the standard optimality theory for infinite horizon problems in discrete time. We formulate alternative conditions based around monotonicity and “value” convexity. These conditions lead to an optimality theory that is as strong as the contractive case. Several applications are provided.
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
