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

This paper introduces a nonlinear certainty-equivalent approximation method for dynamic stochastic problems. We first introduce a novel, stable, and efficient method for computing the decision rules in deterministic dynamic economic problems. We use the results as nonlinear and global...

We introduce a novel simulated certainty equivalent approximation (SCEQ) method for solving dynamic stochastic problems. Our examples show that SCEQ can quickly solve high-dimensional finite- or infinite-horizon, stationary or non- stationary dynamic stochastic problems with hundreds of state...

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

This chapter is concerned with numerical simulation of dynamic economic models. We focus on some basic algorithms and assess their accuracy and stability properties. This analysis is useful for an optimal implementation and testing of these procedures, as well as to evaluate their performance....

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm...

In this paper, we study the throughput of multiclass networks featuring several types of flexible servers as well as general constraints both on the number of servers having the same skills and on the number of servers allowed at each station. Each job class is characterized by its processing...

In this paper we introduce multi-server queueing systems that can be considered as extensions of conventional M/M/s queue to fractional number of servers. We show that the extended Erlang's delay function can be used to calculate delay probabilities for such systems. This approach enables the...