28.12.2013 Views

értekezés - Budapesti Corvinus Egyetem

értekezés - Budapesti Corvinus Egyetem

értekezés - Budapesti Corvinus Egyetem

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

[Figure 13]<br />

Hence, the business unit (or project) X shall be punished with the expected size of<br />

deadweight costs, DL X , attributable to this unit, where p i means the probability of the<br />

group EBITDA to end up in the i th partition, x i is the X item’s percentage of responsibility<br />

that group EBITDA ended up in the i th partition, and m i represents the deadweight cost<br />

endured if group EBITDA ends up in the i th partition.<br />

The distance of partitions can be chosen based on the variation of risk contribution of the<br />

building blocks, the steepness of the cost function, and the number of iterations to be<br />

ideally run. 191 Below, I show the formula with which to calculate the risk contributions of<br />

the identified units from the output data of the Monte Carlo run. I also show that this<br />

calculation can be transformed into the covariance-approach used for normally distributed<br />

variables.<br />

Figure [14] shows that the same logic can be used to account for the deadweight costs of<br />

the interplay between investment decisions and the cost of external finance (the Froot-<br />

Schaferstein-Stein model, 1993).<br />

[Figure 14]<br />

Calculating the risk contributions of identified business units or projects to the distribution<br />

of modeled output variable in a Monte Carlo simulation framework<br />

Portfolio p is the sum of M number of arbitrarily distributed building blocks (whether each<br />

representing a single source of risk factor or a sub-portfolio of risk factors), where x k<br />

represents the k th such building block. After having run N number of iterations within the<br />

MC model, we get the aggregate distribution of portfolio p. We now look for the relative<br />

size of X k ’s contribution – contr(k) – to a given partition S(l) of p’s distribution.<br />

191 The smaller partition distances are selected, the more iterations are needed to have the same sample size<br />

within each partition.<br />

187

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!