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 use the stochastic simulation algorithm, described in Judd, Maliar and Maliar (2009), and the cluster-grid algorithm, developed in Judd, Maliar and Maliar (2010a), to solve a collection of multi-country real business cycle models. The following ingredients help us reduce the cost in...

Economics is the study of how scarce resources are allocated. Operations research studies how to accomplish goals in the least costly manner. These fields have much to offer each other in terms of challenging problems that need to be solved and the techniques to solve them. This was the case...

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...

Continuous-time stochastic games with a finite number of states have substantial computational and conceptual advantages over the more common discrete-time model. In particular, continuous time avoids a curse of dimensionality and speeds up computations by orders of magnitude in games with more...

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...

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...

Numerical dynamic programming algorithms typically use Lagrange data to approximate value functions. This paper uses Hermite data obtained from the optimization step and applies Hermite interpolation to construct approximate value functions. Several examples show that Hermite interpolation...

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...