This paper considers a general class of stochastic dynamic choice models with discrete and continuous decision variables. This class contains a variety of models that are useful for modeling intertemporal household decisions under risk. Our examples are drawn from the field of development...

This paper considers a general class of stochastic dynamic choice models with discrete and continuous decision variables. This class contains a variety of models that are useful for modeling intertemporal household decisions under risk. Our examples are drawn from the field of development...

This paper considers a general class of stochastic dynamic choice models with discrete and continuous decision variables. This class contains a variety of models that are useful for modeling intertemporal household decisions under risk. Our examples are drawn from the field of development...

Dynamic programming is the essential tool in dynamic economic analysis. Problems such as portfolio allocation for individuals and optimal economic growth are typical examples. Numerical methods typically approximate the value function. Recent work has focused on making numerical methods more...

We introduce a computational technique- precomputation of integrals - that makes it possible to construct conditional expectation functions in dynamic stochastic models in the initial stage of a solution procedure. This technique is very general: it works for a broad class of approximating...

We introduce a computational technique- precomputation of integrals - that makes it possible to construct conditional expectation functions in dynamic stochastic models in the initial stage of a solution procedure. This technique is very general: it works for a broad class of approximating...

We develop an envelope condition method (ECM) for dynamic programming problems –a tractable alternative to expensive conventional value function iteration. ECM has two novel features: First, to reduce the cost, ECM replaces expensive backward iteration on Bellman equation with relatively...

We introduce an envelope condition method (ECM) for solving dynamic programming problems. The ECM method is simple to implement, dominates conventional value function iteration and is comparable in accuracy and cost to Carroll’s (2005) endogenous grid method. Codes are available.

Numerical methods for dynamic programming often use value function iteration and interpolation. We present a novel shape-preserving rational spline approximation method that improves value function iteration in terms of both stability and accuracy compared to more common methods.

This paper studies a value function iteration algorithm based on nonexpansive function approximation and Monte Carlo integration that can be applied to almost all stationary dynamic programming problems. The method can be represented using a randomized fitted Bellman operator and a corresponding...