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

Many dynamic problems in economics are characterized by large state spaces which make both computing and estimating the model infeasible. We introduce a method for approximating the value function of high-dimensional dynamic models based on sieves and establish results for the: (a) consistency,...

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

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

The absence of self-control is often viewed as an important correlate of persistent poverty. Using a standard intertemporal allocation problem with credit constraints faced by an individual with quasi- hyperbolic preferences, we argue that poverty damages the ability to exercise self-control....

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 implement a dynamic programming algorithm on a computational grid consisting of loosely coupled processors, possibly including clusters and individual workstations. The grid changes dynamically during the computation, as processors enter and leave the pool of workstations. The algorithm is...

We study a class of infinite-horizon nonlinear dynamic economic models in which preferences, technology and laws of motion for exogenous variables can change over time either deterministically or stochastically, according to a Markov process with time-varying transition probabilities, or both....

We consider a general class of nonlinear optimal policy problems involving forward-looking constraints (such as the Euler equations that are typically present as structural equations in DSGE models), and show that it is possible, under regularity conditions that are straightforward to check, to...