Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/64660
題名: An Efficient Algorithm for Basket Default Swap Valuation
作者: Chiang, Mi-Hsiu ; Yueh, Meng-Lan ; Hsieh, Ming-Hua
江彌修;岳夢蘭;謝明華
貢獻者: 風管系
日期: Dec-2007
上傳時間: 18-Mar-2014
摘要: Monte Carlo simulation has become a workhorse of practical derivatives valuation because it is often impossible to construct theoretical pricing models for real world instruments in closed form. Credit derivatives are a case in point. But a major problem in the use of simulation methods for securities tied to default risk is that they are often written on baskets of individual credits, meaning that the number of correlated random variables to simulate can be very large, and the derivative`s value depends heavily on the correlations among defaults. Individual defaults are very low probability events, so joint defaults are rare indeed. Often, a great many Monte Carlo paths must be simulated to produce even a single credit event for a contract like a k-th-to-default basket swap. Importance sampling, which focuses the simulation effort on the most important paths for a given problem, is a useful variance reduction technique. In this article, the authors present an importance sampling methodology that is easy to implement and guarantees variance reduction for k-th-to-default basket swaps. A set of numerical examples using 1st-, 2nd- and 3rd-to-default contracts based on industry portfolios, each containing five bonds, demonstrates how powerful the approach is. The amount of variance reduction depends on the level of correlation among the credits, which is substantial, and can be an order of magnitude, or even more, for highly correlated risks.
關聯: Journal of Derivatives, 15(2), 8-19
資料類型: article
DOI: http://dx.doi.org/10.3905/jod.2007.699043
Appears in Collections:期刊論文

Files in This Item:
File Description SizeFormat
index.html142 BHTML2View/Open
Show full item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.