This paper proposes a moment-matching method for approximating vector autoregressions by finite-state Markov chains. The Markov chain is constructed by targeting the conditional moments of the underlying continuous process. The proposed method is more robust to the number of discrete values and...

I investigate whether the popular Krusell and Smith algorithm used to solve heterogeneousagent economies with aggregate uncertainty and incomplete markets is likely to be subject to multiple self-fulfilling equilibria. In a benchmark economy, the parameters representing the equilibrium aggregate...

Approximating stochastic processes by finite-state Markov chains is useful for reducing computational complexity when solving dynamic economic models. We provide a new method for accurately discretizing general Markov processes by matching low order moments of the conditional distributions using...

Non-stationary income processes are standard in quantitative life-cycle models, prompted by the observation that within-cohort income inequality increases with age. This paper generalizes Tauchen (1986) and Rouwenhorst's (1995) discretization methods to non-stationary AR(1) processes. We...

The computational time required to solve and estimate dynamic economic models is one of the main constraints in empirical research. The Endogenous Grid Method (EGM) proposed by Carroll (2006) is known to offer impressive speed gains over more traditional stochastic dynamic programming methods,...

The "histogram method" (Young, 2010), while the standard approach for analyzing distributional dynamics in heterogeneous agent models, is linear in optimal policies. We introduce a novel method that captures nonlinearities of distributional dynamics. This method solves the distributional...

This paper describes a method for solving heterogeneous agent models with aggregate risk and many idiosyncratic states formulated in discrete time. It extends the method proposed by Reiter (2009) and complements recent work by Ahn, Kaplan, Moll, Winberry, and Wolf (2017) on how to solve such...

Linear Methods are often used to compute approximate solutions to dynamic models, as these models often cannot be solved analytically. Linear methods are very popular, as they can easily be implemented. Also, they provide a useful starting point for understanding more elaborate numerical...

This paper analyzes the higher-order properties of nested pseudo-likelihood (NPL) estimators and their practical implementation for parametric discrete Markov decision models in which the probability distribution is defined as a fixed point. We propose a new NPL estimator that can achieve...

Sensitivity analysis studies how the variation in the numerical output of a model can be quantitatively apportioned to different sources of variation in basic input parameters. Thus, it serves to examine the robustness of numerical results with respect to input parameters, which is a...