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

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

Discrete-time stochastic games with a finite number of states have been widely applied to study the strategic interactions among forward-looking players in dynamic environments. These games suffer from a “curse of dimensionality” when the cost of computing players’ expectations over all...

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

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

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

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

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

We introduce new stylometry tools based on the sliced conditional compression complexity of literary texts which are inspired by the nearly optimal application of the incomputable Kolmogorov conditional complexity (and presumably approximates it). Whereas other stylometry tools can occasionally...

We present a comprehensive framework for Bayesian estimation of structural nonlinear dynamic economic models on sparse grids. The Smolyak operator underlying the sparse grids approach frees global approximation from the curse of dimensionality and we apply it to a Chebyshev approximation of the...