Pricing options with curved boundaries. (English) Zbl 0900.90098

Math. Finance 2, No. 4, 275-298 (1992); correction ibid. 10, No. 4, 459 (2000).
Summary: This paper provides a general valuation method for the European options whose payoff is restricted by curved boundaries contractually set on the underlying asset price process when it follows the geometric Brownian motion. Our result is based on the generalization of the Levy formula on the Brownian motion by T. W. Anderson in sequential analysis. We give the explicit probability formula that the geometric Brownian motion reaches in an interval at the maturity date without hitting either the lower or the upper curved boundaries. Although the general pricing formulae for options with boundaries are expressed as infinite series in the general case, our numerical study suggests that the convergence of the series is rapid. Our results include the formulae for options with a lower boundary by Merton (1973), for path-dependent options by Goldman, Sossin, and Gatto (1979), and for some corporate securities as special cases.


91B24 Microeconomic theory (price theory and economic markets)
91B28 Finance etc. (MSC2000)
Full Text: DOI


[1] Anderson T. W., Ann. Math. Statist 31 pp 165– (1960)
[2] DOI: 10.1086/260062 · Zbl 1092.91524
[3] DOI: 10.2307/2326607
[4] Cox J. C., Options Markets (1985)
[5] DOI: 10.1016/0304-405X(76)90023-4
[6] DOI: 10.1137/1105027 · Zbl 0100.34004
[7] DOI: 10.2307/2327238
[8] DOI: 10.1016/0022-0531(79)90043-7 · Zbl 0431.90019
[9] Hida T., Brownian Motion (1974)
[10] Ingersoll J. E., J. Financial Econ 4 pp 287– (1979)
[11] Levy P., Processus Stochastique et Mouvement Brownien (1948)
[12] Maruyama G., Nat. Sci. Rep 5 pp 10– (1954)
[13] DOI: 10.2307/3003143
[14] DOI: 10.2307/2328484
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.