LOG IN⠴ݱâ

  • ȸ¿ø´ÔÀÇ ¾ÆÀ̵ð¿Í Æнº¿öµå¸¦ ÀÔ·ÂÇØ ÁÖ¼¼¿ä.
  • ȸ¿øÀÌ ¾Æ´Ï½Ã¸é ¾Æ·¡ [ȸ¿ø°¡ÀÔ]À» ´­·¯ ȸ¿ø°¡ÀÔÀ» ÇØÁֽñ⠹ٶø´Ï´Ù.

¾ÆÀ̵ð ÀúÀå

   

¾ÆÀ̵ð Áߺ¹°Ë»ç⠴ݱâ

HONGGIDONG ˼
»ç¿ë °¡´ÉÇÑ È¸¿ø ¾ÆÀ̵ð ÀÔ´Ï´Ù.

E-mail Áߺ¹È®ÀÎ⠴ݱâ

honggildong@naver.com ˼
»ç¿ë °¡´ÉÇÑ E-mail ÁÖ¼Ò ÀÔ´Ï´Ù.

¿ìÆí¹øÈ£ °Ë»ö⠴ݱâ

°Ë»ö

SEARCH⠴ݱâ

ºñ¹Ð¹øÈ£ ã±â

¾ÆÀ̵ð

¼º¸í

E-mail

Archive

New Bounds on American Option Prices

  • In Joon Kim Yonsei University
  • Geun Hyuk Chang Woori Bank
  • Suk Joon Byun Graduate School of Finance Korea Advanced Institute of Science and Technology
In this article, we develop new upper and lower bounds on American option prices which improve the bounds by Broadie and Detemple. The main idea is the consideration of doubly capped call options which have two cap prices. We present a new option price approximation based on the two upper bounds. On average, our upper bound extrapolation (named UBE) has an average accuracy better than a 1,000 time-step binomial tree with a computation speed comparable to a 100 time-step binomial tree. We also provide a new method of approximating the optimal exercise boundaries of American options.

  • In Joon Kim
  • Geun Hyuk Chang
  • Suk Joon Byun
In this article, we develop new upper and lower bounds on American option prices which improve the bounds by Broadie and Detemple. The main idea is the consideration of doubly capped call options which have two cap prices. We present a new option price approximation based on the two upper bounds. On average, our upper bound extrapolation (named UBE) has an average accuracy better than a 1,000 time-step binomial tree with a computation speed comparable to a 100 time-step binomial tree. We also provide a new method of approximating the optimal exercise boundaries of American options.
American option,Optimal exercise boundary,Approximation,Bound,Cap