Abstract

Constructing a balanced and sufficiently detailed Social Accounting Matrix (SAM) is a necessary step for any work with Computable General Equilibrium (CGE) models. Even when starting with a given SAM, researchers might wish to develop their own, more detailed variants for a specific study by dis-aggregating sectors and products, a process termed splitting the SAM. We review three approaches for balancing and splitting a SAM: Cross-Entropy (CE), a Highest Posterior Density (HPD) estimator resulting in a quadratic loss penalty function, and a linear loss penalty function. The exercise considers upper and lower bounds on the (new) SAM entries, different weights for penalizing deviations from a priori information, and unknown row or column totals, to give the user flexibility in controlling outcomes. The approaches are assessed first by a systematic Monte-Carlo experiment. It re-balances smaller SAMs, after errors with known distributions are added. Here we find quite limited numerical differences between the CE and quadratic loss approaches. The CE approach was however considerably slower than the other candidates. Second, we tested the three approaches for dis-aggregating the Global Trade Analysis Project (GTAP) data base to provide, as an example, further agri-food detail. In such empirical applications, the distribution of the errors of the new SAM entries is typically not known. As in the SAM balancing exercise, we use CONOPT4 as a multi-purpose (non)linear solver which can be also be employed to solve the CGE model itself. For comparison, we add the specialized Linear and Quadratic Programming (QP) solvers CPLEDX and GUROBI. As in the Monte-Carlo experiment, the differences in results between the three approaches were moderate. The specialized solvers require very little time to solve the linear and quadratic loss problems. However, they did not achieve the same, very high accuracy as CONOPT4 for the quadratic loss problem. The CE problem could take longer by a factor of 100 or more, compared to a linear or quadratic loss approach solved with the specialized solvers. We conclude that using linear or quadratic loss approaches, especially combined with a specialized solver, are the most suitable candidates for larger SAM splitting / balancing problems. Additionally, we present a fast and accurate data processing chain to yield a benchmark data set for a CGE model from the GTAP Data Base which involves filtering out small cost, expenditure and revenue shares, and allows users to introduce further product and sectoral detail based on user provided information.

Highlights

  • Building up the data base for a global Computable General Equilibrium (CGE)model requires merging different data sets while adhering to exhaustion conditions, macro-economic identities and other constraints

  • 3 We provide as part of the General Algebraic Modeling System (GAMS) code which documents the Monte-Carlo experiments a GAMS script for a RAS

  • For the simple Monte-Carlo experiments discussed we provide the GAMS code in Appendix A and in the supplementary materials published with this manuscript

Read more

Summary

Introduction

Model requires merging different data sets while adhering to exhaustion conditions, macro-economic identities and other constraints. After briefly reviewing three penalty approaches, this paper systematically compares their performance, using first controlled matrix balancing problems and second differently detailed empirical problems which dis-aggregate the global GTAP Data Base with regard to products and sectors. Schneider and Zenios (1990), for instance, compare RAS and constrained optimization with quadratic, entropy and linear penalty functions with a focus on computational aspects They highlight the possibility to introduce user-imposed bounds, to estimate unknown row/column totals, and to consider different data reliabilities for the SAM entries as advantages of the constrained optimization approach. The following main body of the paper compares these approaches first based on Monte-Carlo experiments with constructed square matrices under known distributions of the error terms, and on more complex SAM dis-aggregation, applied to differently detailed global data sets

A general view on data balancing and fusion
Candidate algorithms for data balancing
Set up
Results
Dis-aggregation the global GTAP Data Base
Results for the dis-aggregation exercise
Summary and conclusion
Core program
G-RAS plus DSS routine
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.