Abstract

The endogenous grid method (EGM) significantly speeds up the solution of stochastic dynamic programming problems by simplifying or completely eliminating rootfinding. We propose a general and parsimonious EGM extended to handle 1) multiple continuous states and choices, 2) multiple occasionally binding constraints, and 3) non-convexities such as discrete choices. Our method enjoys the speed gains of the original one-dimensional EGM, while avoiding expensive interpolation on multi-dimensional irregular endogenous grids. We explicitly define a broad class of models for which our solution method is applicable, and illustrate its speed and accuracy using a consumption-saving model with both liquid assets and illiquid pension assets and a discrete retirement choice.

Full Text
Paper version not known

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

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.