We introduce the market resources method (MRM) for solving dynamic optimization problems. MRM extends Carroll's (2006) endogenous grid point method (EGM) for problems with more than one control variable using policy function iteration. The MRM algorithm is simple to implement and provides...

We introduce the market resources method (MRM) for solving dynamic optimization problems. MRM extends Carroll’s (2006) endogenous grid point method (EGM) for problems with more than one control variable using policy function iteration. The MRM algorithm is simple to implement and provides...

We study a generalized version of Coleman (1990)'s time iteration method (GTI) for solving dynamic optimization problems. Our benchmark framework is an irreversible investment model with labor-leisure choice. The GTI algorithm is simple to implement and provides advantages in terms of speed...

We study a generalized version of Coleman (1990)’s time iteration method (GTI) for solving dynamic optimization problems. Our benchmark framework is an irreversible investment model with labor-leisure choice. The GTI algorithm is simple to implement and provides advantages in terms of speed...

We introduce an envelope condition method (ECM) for solving dynamic programming problems. ECM iterates on the Bellman equation forward and is much faster than conventional value function methods that iterate backward. In the studied examples, ECM is comparable in accuracy and cost to Carroll's...

In this paper, the Partial Distribution (PD) and multivariate Partial Distribution (MPD) are presented in their concepts, properties and applications, and PD is compared with the lognormal and the levy distribution. Though the levy distribution is better to describe the exchange returns in...

Strategies for constructing a Markov decision chain approximating a continuous-time finite-horizon optimal control problem are investigated. Some simple, analytically soluble, examples are treated and low computational complexity is reported. Extensions to the method and implementation are...

This paper compares the performance of the Howard (1960) policy iteration algorithm for infinite-horizon continuous-state Markovian decision processes (MDP's) using alternative random, quasi-random, and deterministic discretizations of the state space, or grids. Each grid corresponds to an...