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

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

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

The problem of simultaneously identifying and controlling a time-varying, perfectly-observed linear system is posed. The parameters are assumed to obey a Markov structure and are estimated with a Kalman filter. The problem can be solved conceptually by dynamic programming, but even with a...

We propose an integrated treatment of the problems of optimal monetary and fiscal policy, for an economy in which prices are sticky and the only available sources of government revenue are distorting taxes. Our linear-quadratic approach allows us to nest both conventional analyses of optimal...

The goal of this paper is to study the problem of optimal dynamic policy formulation with competing political parties. We study a general class of problems, in which the two competing political parties have quadratic intertemporal objective functions, and in which the economy has a linear...

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

Rules often are complex in order to distinguish different types of behavior that may have different consequences. Greater complexity thus allows better control of behavior. But individuals may need to incur costs ex ante to determine how more complex rules apply to their contemplated conduct....