An algorithm for sequential solutions of dynamic CGE models with perfect foresight over an infinite numbers of periods
We describe a simple algorithm that permits the sequential (period-by-period) solution of large-scale dynamic CGE models with agents who have perfect foresight over an infinite number of periods. The algorithm requires neither any assumptions about behavior in a ?final? period nor that the base case economy be currently in steady state. We briefly illustrate the algorithm with an analysis of substituting a flat tax for all income taxes in the United States.
|Date of creation:||2006|
|Contact details of provider:|| Postal: 3016 Pamplin Hall, Blacksburg, VA 24061-0316|
Web page: http://www.econ.vt.edu
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Wendner, Ronald, 1999. "A Calibration Procedure of Dynamic CGE Models for Non-steady State Situations Using GEMPACK," Computational Economics, Springer;Society for Computational Economics, vol. 13(3), pages 265-287, June.
- Blejer, Mario I. & Feldman, Ernesto V. & Feltenstein, Andrew, 2002. "Exogenous shocks, contagion, and bank soundness: a macroeconomic framework," Journal of International Money and Finance, Elsevier, vol. 21(1), pages 33-52, February.
- Dixon, Peter B. & Pearson, K.R. & Picton, Mark R. & Rimmer, Maureen T., 2005. "Rational expectations for large CGE models: A practical algorithm and a policy application," Economic Modelling, Elsevier, vol. 22(6), pages 1001-1019, December.
When requesting a correction, please mention this item's handle: RePEc:vpi:wpaper:e07-6. 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: (Djavad Salehi-Isfahani)
If references are entirely missing, you can add them using this form.