We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization. Quantum annealers attempt to solve an NP-hard problem by starting in a quantum superposition of all...

We introduce a novel approach to solving dynamic programming problems, such as those in many economic models, on a quantum annealer, a specialized device that performs combinatorial optimization. Quantum annealers attempt to solve an NP-hard problem by starting in a quantum superposition of all...

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

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

This paper discusses solution procedures for real business cycle (RBC) models. First, we show that the most often used solution methods, the linear-quadratic approximation, the Lagrange multiplier, and the Euler equation approach all lead to the same decision function. Second, we demonstrate...

We introduce a fast upper-envelope scan (FUES) method to compute solutions for dynamic programming problems with continuous and discrete choices. The FUES method builds on the standard endogenous grid method (EGM). Standard EGM applied to problems with continuous and discrete choices does not by...

I introduce and evaluate a new stochastic simulation method for dynamic economic models. It is based on recent work in the operations research and engineering literatures (Van Roy et. al, 1997; Powell, 2007; Bertsekas, 2011). The baseline method involves rewriting the household's dynamic program in...

We propose a new method for solving high-dimensional dynamic programming problems and recursive competitive equilibria with a large (but finite) number of heterogeneous agents using deep learning. The "curse of dimensionality" is avoided due to four complementary techniques: (1) exploiting...

This paper discusses how to design, solve and estimate dynamic programming models using the open source package niqlow. Reasons are given for why such a package has not appeared earlier and why the object-oriented approach followed by niqlow seems essential. An example is followed that starts...