Fast Monte Carlo Simulation for Pricing Equity-Linked Securities
- Authors
- Jang, Hanbyeol; Kim, Sangkwon; Han, Junhee; Lee, Seongjin; Ban, Jungyup; Han, Hyunsoo; Lee, Chaeyoung; Jeong, Darae; Kim, Junseok
- Issue Date
- 12월-2020
- Publisher
- SPRINGER
- Keywords
- Monte Carlo simulation; Equity-linked securities; Option pricing; Brownian bridge
- Citation
- COMPUTATIONAL ECONOMICS, v.56, no.4, pp.865 - 882
- Indexed
- SCIE
SSCI
SCOPUS
- Journal Title
- COMPUTATIONAL ECONOMICS
- Volume
- 56
- Number
- 4
- Start Page
- 865
- End Page
- 882
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/130335
- DOI
- 10.1007/s10614-019-09947-2
- ISSN
- 0927-7099
- Abstract
- In this paper, we present a fast Monte Carlo simulation (MCS) algorithm for pricing equity-linked securities (ELS). The ELS is one of the most popular and complex financial derivatives in South Korea. We consider a step-down ELS with a knock-in barrier. This derivative has several intermediate and final automatic redemptions when the underlying asset satisfies certain conditions. If these conditions are not satisfied until the expiry date, then it will be checked whether the stock path hits the knock-in barrier. The payoff is given depending on whether the path hits the knock-in barrier. In the proposed algorithm, we first generate a stock path for redemption dates only. If the generated stock path does not satisfy the early redemption conditions and is not below the knock-in barrier at the redemption dates, then we regenerate a daily path using Brownian bridge. We present numerical algorithms for one-, two-, and three-asset step-down ELS. The computational results demonstrate the efficiency and accuracy of the proposed fast MCS algorithm. The proposed fast MCS approach is more than 20 times faster than the conventional standard MCS.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.