Multiplicative Decomposition And Index Number Theory: An Empirical Application Of The Sato-Vartia Decomposition
In de Boer (2008), additive decompositions of aggregate changes in a variable into its factors were considered. We proposed using the 'ideal' Montgomery decomposition, developed in index number theory as an alternative to the commonly used methods in structural decomposition analysis, and applied it to the example analyzed by Dietzenbacher and Los (1998) (D&L). In this paper we consider multiplicative decompositions and show that the method proposed by D&L of taking the geometric mean of all elementary decompositions is 'ideal'. However, it requires the computation of an ever-increasing number of decompositions when the number of factors increases. As an alternative, we propose using the Sato-Vartia decomposition, which is also 'ideal', but requires the computation of only one decomposition. Application to the example of D&L reveals that the two methods yield results that are very close to each other.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 21 (2009)
Issue (Month): 2 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/CESR20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/CESR20|
When requesting a correction, please mention this item's handle: RePEc:taf:ecsysr:v:21:y:2009:i:2:p:163-174. 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: (Michael McNulty)
If references are entirely missing, you can add them using this form.