Heuristic models have been proposed for many domains of choice. We compare heuristic models of intertemporal choice, which can account for many of the known intertemporal choice anomalies, to discounting models. We conduct an out-of-sample, cross-validated comparison of intertemporal choice...

This paper proposes a method for separating economic time series into a smooth component whose mean varies over time (the trend') and a stationary component (the cycle'). The aim is to make the trends as smooth as possible while also producing cycles with plausible properties. While the main...

When all financial assets have risky returns, the mean-variance portfolio model is potentially subject to two types of bliss points. One bliss point arises when a von Neumann-Morgenstern utility function displays negative marginal utility for sufficiently large end-of-period wealth, such as in...

We benchmark seven global optimization algorithms by comparing their performance on challenging multidimensional test functions as well as a method of simulated moments estimation of a panel data model of earnings dynamics. Five of the algorithms are taken from the popular NLopt open-source...

We calculate the socially optimal level of illiquidity in an economy populated by households with taste shocks and present bias (Amador, Werning, and Angeletos 2006). The government chooses mandatory contributions to respective spending/savings accounts, each with a different pre-retirement...

Should the generosity of unemployment benefits and the progressivity of income taxes depend on the presence of business cycles? This paper proposes a tractable model where there is a role for social insurance against uninsurable shocks to income and unemployment, as well as inefficient business...

We implement a dynamic programming algorithm on a computational grid consisting of loosely coupled processors, possibly including clusters and individual workstations. The grid changes dynamically during the computation, as processors enter and leave the pool of workstations. The algorithm is...