Simulating Computable Overlapping Generations Models With Troll
In this paper, we examine the performance of the Troll Stacked- time algorithm in the simulation of large scale overlapping generations (OLG) models. At each period of time, the number of equations is proportional to the individual length of lifetime. The model size and the data requirements may thus be very large. Given the repetitive structure of the equations, we show how Troll specific macrocommands can be used to explode a generic version (in which the lifetime is parameterized) into a complete model. A similar technique applies to explode the initial dataset on the whole simulation horizon. The stability properties of the model are derived and the Stacked-time algorithm performances are checked for a large scale model with endogenous labour supply and uncertain lifetime. It turns out that Troll performances are very attractive even for a system of 300000 simultaneous equations."
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||05 Jul 2000|
|Date of revision:|
|Contact details of provider:|| Postal: |
Fax: +34 93 542 17 46
Web page: http://enginy.upf.es/SCE/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf0:246. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum)
If references are entirely missing, you can add them using this form.