Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/26780
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRausch, Sebastianen_US
dc.contributor.authorRutherford, Thomas F.en_US
dc.date.accessioned2007-07-02en_US
dc.date.accessioned2009-08-06T09:01:45Z-
dc.date.available2009-08-06T09:01:45Z-
dc.date.issued2007en_US
dc.identifier.isbn978-3-86788-009-1en_US
dc.identifier.urihttp://hdl.handle.net/10419/26780-
dc.description.abstractThis paper develops a decomposition algorithm by which a market economy with many households may be solved through the computation of equilibria for a sequence of representative agent economies. The paper examines local and global convergence properties of the sequential recalibration (SR) algorithm. SR is then demonstrated to efficiently solve Auerbach-Kotlikoff OLG models with a large number of heterogeneous households. We approximate equilibria in OLG models by solving a sequence of related Ramsey optimal growth problems.This approach can provide improvements in both efficiency and robustness as compared with simultaneous solution-methods.en_US
dc.language.isoengen_US
dc.publisher|aRWI|cEssenen_US
dc.relation.ispartofseries|aRuhr economic papers|x15en_US
dc.subject.jelC68en_US
dc.subject.jelC81en_US
dc.subject.jelD61en_US
dc.subject.jelD91en_US
dc.subject.ddc330en_US
dc.subject.keywordComputable general equilibriumen_US
dc.subject.keywordoverlapping generationsen_US
dc.subject.keywordmicrosimulationen_US
dc.subject.keywordsequential recalibrationen_US
dc.subject.stwCGE-Modellingen_US
dc.subject.stwAllgemeines Gleichgewichten_US
dc.subject.stwDekompositionsverfahrenen_US
dc.subject.stwOverlapping Generationsen_US
dc.subject.stwTheorieen_US
dc.titleComputation of Equilibria in OLG Models with Many Heterogeneous Householdsen_US
dc.type|aWorking Paperen_US
dc.identifier.ppn534690505en_US
dc.rightshttp://www.econstor.eu/dspace/Nutzungsbedingungen-
dc.identifier.repecRePEc:zbw:rwirep:15-

Files in This Item:
File
Size
286.87 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.