A fast and low computational memory algorithm for non-stochastic simulations in heterogeneous agent models

Heterogeneous agent models in macroeconomics generally require numerical computation of the cross-sectional distribution of agents. The standard textbook approach is to fully approximate the Markov kernel that iterates the distribution forward in time as a Markov transition matrix, which can be cost...

Full description

Saved in:
Bibliographic Details
Published inEconomics letters Vol. 193; p. 109285
Main Author Tan, Eugene
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.08.2020
Elsevier Science Ltd
Subjects
Online AccessGet full text
ISSN0165-1765
1873-7374
DOI10.1016/j.econlet.2020.109285

Cover

More Information
Summary:Heterogeneous agent models in macroeconomics generally require numerical computation of the cross-sectional distribution of agents. The standard textbook approach is to fully approximate the Markov kernel that iterates the distribution forward in time as a Markov transition matrix, which can be costly in terms of computational time and memory when the state space is large. This note provides an alternative algorithm that is simple, requires much less computational memory, and is substantially faster than the standard algorithm. •New algorithm for iterating distributions forward in heterogeneous agent models.•Uses substantially less computational memory and faster than textbook methods.•Gains generally increase when state space of model increases.•Most suitable for interpreted languages (e.g., MATLAB, Python).•General pseudo-code is provided for a broad class of models.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0165-1765
1873-7374
DOI:10.1016/j.econlet.2020.109285