Local (perturbation) methods compute solutions in one point and tend to deliver far lower accuracy levels than global solution methods. We develop a hybrid method that solves for some policy functions locally (using a perturbation method) and that solves for the other policy functions globally...

We extend the hiring and firing framework of Shepp and Shiryaev (J Econ Dyn Control 20:1523–1539, <CitationRef CitationID="CR5">1996</CitationRef>) to include infighting, and solve the profit-maximization problem using our numerical technique. With infighting, we find a smaller optimal firm size, and lowered firm value that stems from...</citationref>

In models of first-price auctions, when bidders are ex ante heterogeneous, deriving explicit equilibrium bid functions is typically impossible, so numerical methods are often employed to find approximate solutions. Recent theoretical research concerning asymmetric auctions has determined some...

This paper compares numerical methods for solving the competitive storage model. Because storage implies a nonnegativity constraint on stocks, the solution methods must be considered carefully. The model is solved using value function iteration and several projection approaches, including...

Effective teaching of computational methods to economists in an introductory graduate-level course requires difficult choices regarding the material to be covered, the level at which the material will be covered, and the role of assigned exercises, laboratory sessions, and required readings. In...

The standard neoclassical growth model with quasi-geometric discounting is shown elsewhere (Krusell, P. and Smith, A., CEPR Discussion Paper No. 2651, 2000) to have multiple solutions. As a result, value-iterative methods fail to converge. The set of equilibria is however reduced if we restrict...