부산대학교 도서관

In a previous paper by Thomassen and Van Wouwe [5] the notion of an n-fold compound option was introduced as a generalization of Geske’s compound option [3]. To compute such an n-fold numerically remains possible but tedious because most algorithms are not capable to compute multivariate normal CDF’s for higher dimensions (n >= 3). For that reason a proof to regard an n-fold as an (n-k)-fold on a k-fold is given and allows for example to decompose a 6-fold compound option into a 2-fold and a 4-fold.