We introduce a technique called "precomputation of integrals" that makes it possible to compute conditional expectations in dynamic stochastic models in the initial stage of the solution procedure. This technique can be applied to any set of equations that contains conditional expectations, in...

A nonlinear programming formulation is introduced to solve infinite horizon dynamic programming problems. This extends the linear approach to dynamic programming by using ideas from approximation theory to avoid inefficient discretization. Our numerical results show that this nonlinear...

We characterize and demonstrate a solution method for an optimal commodity (sales) tax problem consisting of multiple goods, heterogeneous agents, and a nonconvex policy maker optimization problem. Our approach allows for more dimensions of heterogeneity than has been previously possible,...

We apply numerical dynamic programming to multi-asset dynamic portfolio optimization problems with proportional transaction costs. Examples include problems with one safe asset plus two to six risky stocks, and seven to 360 trading periods in a finite horizon problem. These examples show that it...

In conventional stochastic simulation algorithms, Monte Carlo integration and curve fitting are merged together and implemented by means of regression. We perform a decomposition of the solution error and show that regression does a good job in curve fitting but a poor job in integration, which...

We introduce an algorithm for solving dynamic economic models that merges stochastic simulation and projection approaches: we use simulation to approximate the ergodic measure of the solution, we construct a fixed grid covering the support of the constructed ergodic measure, and we use...

Continuous time is a superior representation of both the economic and climate systems that Integrated Assessment Models (IAM) aim to study. Moreover, continuous-time representations are simple to express. Continuous-time models are usually solved by discretizing time, but the quality of a...

First, we propose a more efficient implementation of the Smolyak method for interpolation, namely, we show how to avoid costly evaluations of repeated basis functions in the conventional Smolyak formula. Second, we extend the Smolyak method to include anisotropic constructions; this allows us to...

Numerical dynamic programming algorithms typically use Lagrange data to approximate value functions over continuous states. Hermite data is easily obtained from solving the Bellman equation and can be used to approximate value functions. We illustrate this method with one-, three-, and...

There is great uncertainty about the impact of anthropogenic carbon on future economic wellbeing. We use DSICE, a DSGE extension of the DICE2007 model of William Nordhaus, which incorporates beliefs about the uncertain economic impact of possible climate tipping events and uses empirically...