Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/26780 
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRausch, Sebastianen
dc.contributor.authorRutherford, Thomas F.en
dc.date.accessioned2007-07-02-
dc.date.accessioned2009-08-06T09:01:45Z-
dc.date.available2009-08-06T09:01:45Z-
dc.date.issued2007-
dc.identifier.isbn978-3-86788-009-1en
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
dc.language.isoengen
dc.publisher|aRheinisch-Westfälisches Institut für Wirtschaftsforschung (RWI) |cEssenen
dc.relation.ispartofseries|aRuhr Economic Papers |x15en
dc.subject.jelC68en
dc.subject.jelC81en
dc.subject.jelD61en
dc.subject.jelD91en
dc.subject.ddc330en
dc.subject.keywordComputable general equilibriumen
dc.subject.keywordoverlapping generationsen
dc.subject.keywordmicrosimulationen
dc.subject.keywordsequential recalibrationen
dc.subject.stwCGE-Modellingen
dc.subject.stwAllgemeines Gleichgewichten
dc.subject.stwDekompositionsverfahrenen
dc.subject.stwOverlapping Generationsen
dc.subject.stwTheorieen
dc.titleComputation of Equilibria in OLG Models with Many Heterogeneous Households-
dc.typeWorking Paperen
dc.identifier.ppn534690505en
dc.rightshttp://www.econstor.eu/dspace/Nutzungsbedingungenen
dc.identifier.repecRePEc:zbw:rwirep:15en

Files in This Item:
File
Size
286.87 kB





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