We propose and study properties of several estimators of variance decomposition in the local-projections framework. We find for empirically relevant sample sizes that, after being bias corrected with bootstrap, our estimators perform well in simulations. We also illustrate the workings of our...

In an earlier paper, we showed that the value of shadow prices depends on how the government contemplates re- equilibrating the economy to the perturbation associated with any project, except in the extreme case where the government has chosen all policy instruments optimally. Only under...

We outline a method to provide advice on optimal monetary policy while taking policymakers' judgment into account. The method constructs Optimal Policy Projections (OPPs) by extracting the judgment terms that allow a model, such as the Federal Reserve Board's FRB/US model, to reproduce a...

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

A new algorithm for the group minimization problem (GP) is proposed. The algorithm can be broadly described as follows. A suitable relaxation of(GP) is defined, in which any feasible point satisfies the group equation but may have negative components. The feasible points of the relaxation are...