Efficient Computation with Taste Shocks

34 Pages Posted: 22 Oct 2019

See all articles by Grey Gordon

Grey Gordon

Federal Reserve Banks - Federal Reserve Bank of Richmond

Date Written: 2019-09-11


Taste shocks result in nondegenerate choice probabilities, smooth policy functions, continuous demand correspondences, and reduced computational errors. They also cause significant computational cost when the number of choices is large. However, I show that, in many economic models, a numerically equivalent approximation may be obtained extremely efficiently. If the objective function has increasing differences (a condition closely tied to policy function monotonicity) or is concave in a discrete sense, the proposed algorithms are O(n log n) for n states and n choice--a drastic improvement over the naive algorithm's O(n2) cost. If both hold, the cost can be further reduced to O(n). Additionally, with increasing differences in two state variables, I propose an algorithm that in some cases is O(n2) even without concavity (in contrast to the O(n3) naive algorithm). I illustrate the usefulness of the proposed approach in an incomplete markets economy and a long-term sovereign debt model, the latter requiring taste shocks for convergence. For grid sizes of 500 points, the algorithms are up to 200 times faster than the naive approach.

Keywords: Computation, Monotonicity, Discrete Choice, Taste Shocks, Sovereign Default, Curse of Dimensionality

JEL Classification: C61, C63, E32, F34, F41, F44

Suggested Citation

Gordon, Grey, Efficient Computation with Taste Shocks (2019-09-11). FRB Richmond Working Paper No. 19-15, Available at SSRN: https://ssrn.com/abstract=3473121

Grey Gordon (Contact Author)

Federal Reserve Banks - Federal Reserve Bank of Richmond ( email )

P.O. Box 27622
Richmond, VA 23261
United States

Here is the Coronavirus
related research on SSRN

Paper statistics

Abstract Views
PlumX Metrics