Research article Special Issues

Closed-form approximate solutions for stop-loss and Russian options with multiscale stochastic volatility

  • Received: 11 June 2023 Revised: 16 August 2023 Accepted: 23 August 2023 Published: 29 August 2023
  • MSC : 91G20, 91G60

  • In general, derivation of closed-form analytic formulas for the prices of path-dependent exotic options is a challenging task when the underlying asset price model is chosen to be a stochastic volatility model. Pricing stop-loss and Russian options is studied under a multiscale stochastic volatility model in this paper. Both options are commonly perpetual American-style derivatives with a lookback provision. We derive closed-form formulas explicitly for the approximate prices of these two exotic options by using multiscale asymptotic analysis and partial differential equation method. The formulas can be efficiently computed starting with the Black-Scholes option prices. The accuracy of the analytic approximation is verified via Monte-Carlo simulations and the impacts of the multiscale stochastic volatility on the corresponding Black-Scholes option prices are revealed. Also, the performance of the model is compared with that of other models.

    Citation: Min-Ku Lee, Jeong-Hoon Kim. Closed-form approximate solutions for stop-loss and Russian options with multiscale stochastic volatility[J]. AIMS Mathematics, 2023, 8(10): 25164-25194. doi: 10.3934/math.20231284

    Related Papers:

    [1] Danielle Hilhorst, Hideki Murakawa . Singular limit analysis of a reaction-diffusion system with precipitation and dissolution in a porous medium. Networks and Heterogeneous Media, 2014, 9(4): 669-682. doi: 10.3934/nhm.2014.9.669
    [2] Steinar Evje, Aksel Hiorth, Merete V. Madland, Reidar I. Korsnes . A mathematical model relevant for weakening of chalk reservoirs due to chemical reactions. Networks and Heterogeneous Media, 2009, 4(4): 755-788. doi: 10.3934/nhm.2009.4.755
    [3] Tasnim Fatima, Ekeoma Ijioma, Toshiyuki Ogawa, Adrian Muntean . Homogenization and dimension reduction of filtration combustion in heterogeneous thin layers. Networks and Heterogeneous Media, 2014, 9(4): 709-737. doi: 10.3934/nhm.2014.9.709
    [4] Chaoqun Huang, Nung Kwan Yip . Singular perturbation and bifurcation of diffuse transition layers in inhomogeneous media, part I. Networks and Heterogeneous Media, 2013, 8(4): 1009-1034. doi: 10.3934/nhm.2013.8.1009
    [5] Steinar Evje, Aksel Hiorth . A mathematical model for dynamic wettability alteration controlled by water-rock chemistry. Networks and Heterogeneous Media, 2010, 5(2): 217-256. doi: 10.3934/nhm.2010.5.217
    [6] Alexander Mielke, Sina Reichelt, Marita Thomas . Two-scale homogenization of nonlinear reaction-diffusion systems with slow diffusion. Networks and Heterogeneous Media, 2014, 9(2): 353-382. doi: 10.3934/nhm.2014.9.353
    [7] James Nolen . A central limit theorem for pulled fronts in a random medium. Networks and Heterogeneous Media, 2011, 6(2): 167-194. doi: 10.3934/nhm.2011.6.167
    [8] Peter V. Gordon, Cyrill B. Muratov . Self-similarity and long-time behavior of solutions of the diffusion equation with nonlinear absorption and a boundary source. Networks and Heterogeneous Media, 2012, 7(4): 767-780. doi: 10.3934/nhm.2012.7.767
    [9] Serge Nicaise, Cristina Pignotti . Asymptotic analysis of a simple model of fluid-structure interaction. Networks and Heterogeneous Media, 2008, 3(4): 787-813. doi: 10.3934/nhm.2008.3.787
    [10] Riccardo Bonetto, Hildeberto Jardón Kojakhmetov . Nonlinear diffusion on networks: Perturbations and consensus dynamics. Networks and Heterogeneous Media, 2024, 19(3): 1344-1380. doi: 10.3934/nhm.2024058
  • In general, derivation of closed-form analytic formulas for the prices of path-dependent exotic options is a challenging task when the underlying asset price model is chosen to be a stochastic volatility model. Pricing stop-loss and Russian options is studied under a multiscale stochastic volatility model in this paper. Both options are commonly perpetual American-style derivatives with a lookback provision. We derive closed-form formulas explicitly for the approximate prices of these two exotic options by using multiscale asymptotic analysis and partial differential equation method. The formulas can be efficiently computed starting with the Black-Scholes option prices. The accuracy of the analytic approximation is verified via Monte-Carlo simulations and the impacts of the multiscale stochastic volatility on the corresponding Black-Scholes option prices are revealed. Also, the performance of the model is compared with that of other models.



    Currently, Mallat algorithm is used for multiple-scale analysis (KMA) of signals, since he has developed a fast way to calculate discrete wavelet transform (WT). The idea of MSA is that the signal is decomposed according to the basis formed by shifts and multiple-scale copies of the wavelet function. KMA is an m-step discrete WT. The maximum value of m is called the depth of decomposition. In [1,2] the interpretation of the discrete WT is given. Sometimes discrete WT is used in conjunction with other transformations, for example, in [3]. In such cases, the disadvantages of discrete WT are still impossible to completely eliminate, because it is similar to how it is impossible to improve the error by calculating formulas with great accuracy if the measurements were made roughly. And the discrete WT has disadvantages:

    1) The scaling factor changes only with a multiplicity of 2.

    2) The wavelets are not symmetric or antisymmetric.

    3) The accuracy of the calculation decreases with an increase in the decomposition level, since at each decomposition level the sample length decreases by 2 times.

    4) The amplitude-frequency response of wavelets is uneven.

    5) It is necessary to have a scaling function.

    6) Progressive scan of the image is not used for multiple-scale analysis.

    7) It is necessary to solve many equations for constructing wavelets of large orders.

    To eliminate these disadvantages, the use of continuous WT is relevant. The difference between discrete and continuous WT is still in the method of calculation. If in order to calculate the wavelet coefficients of the next level with discrete WT, it is necessary to calculate the previous wavelet coefficients, then with continuous WT, all the wavelet coefficients can be calculated in parallel. At the hardware level, it can be imagined as if the signal passes through a parallel connection of filters. Continuous WT is calculated using computers, then this transformation is called a discrete version of continuous WT. In [4], such a transformation is called a discrete-time wavelet transform (DTWT).

    It was noted in [5]: "For practice, it would be desirable to have orthogonal symmetric and asymmetric wavelets, but there are no such ideal wavelets". Indeed, there are no orthogonal symmetric and antisymmetric wavelets for a WT. They write about continuous WT in [5]: "Coarse wavelets have a minimum of properties that wavelets should have, providing full-fledged capabilities in signal conversion technology: the analysis is not orthogonal; the possibility of reconstruction is not guaranteed; fast transformation algorithms and accurate reconstruction are impossible".

    The authors' research shows that orthogonal symmetric and antisymmetric wavelets can be constructed, fast algorithms are possible, and the signal can be accurately reconstructed.

    Wavelets and pulse characteristics of filters are closely interrelated. The wavelets with the largest scale factor are low-pass filters, those with the average scale factor are bandpass filters, and the smallest scale factor is high-pass filters. It can be said that the construction of orthogonal symmetric and antisymmetric wavelets is the same as the synthesis of digital filters with a rectangular amplitude-frequency response (frequency response). In the literature on digital filters, it is noted that rectangular frequency response leads to pulsations to the left and right of the cutoff frequency and the appearance of a transition band (Gibbs phenomenon). This is explained by the truncation of the Fourier series. The shorter the series, the greater the deviation of the frequency response from the initial one at steep drops. Explain the Gibbs phenomenon still using the convolution property.

    In the theory of generalized Fourier transform (FT), it is proved that wavelets are orthogonal if the scalar product of these wavelets is zero. The authors' research shows that the smaller the overlap of the wavelet spectra for different scale coefficients, the smaller the scalar product of these wavelets. There will be no overlap when the spectra have a rectangular shape. For example, wavelets based on derivatives of the Gaussian function (coarse wavelets) have a smaller scalar product value if the order of the derivative is greater. The spectra of these wavelets are narrower, closer to a rectangular shape, there is less overlap and the reconstruction of the signal is more accurate. Although it is written about discrete wavelets that they are orthogonal, in fact this is not quite true, because the spectra of all such wavelets overlap. Just as continuous wavelets allow you to reconstruct a signal with one or another accuracy, so discrete wavelets allow you to reconstruct a signal with one or another accuracy and no better. But the continuous WT allows for multi-scale image analysis not only with a zoom factor equal to 2, but also with a multiplicity less than 2, to perform calculations in the frequency domain using the fast Fourier transform (FFT). The transition to the frequency domain allows us to design wavelets with specified properties that cannot be obtained in the time domain.

    During the research, it was possible to construct orthogonal symmetric and antisymmetric wavelets. Figure 1 shows one of these wavelets. Figure 2 shows the frequency response of this wavelet in decibels.

    Figure 1.  Orthogonal symmetric wavelet.
    Figure 2.  Frequency response of a symmetric orthogonal wavelet in dB.

    It can be seen that the attenuation in the delay band is about -300 dB, which is comparable to the calculation error. The scalar product of such wavelets is zero within the margin of error. This is observed for all scalar products of wavelets with other scale coefficients. There are no ripples in the bandwidth on the frequency response. Figure 3 shows the frequency response of this wavelet. It can be seen that there is no transition band. The covariance matrix for such a WT is diagonal. Figure 4 shows such a matrix. In Figure 5 covariance matrix for wavelets based on derivatives of the Gaussian function. Here the matrix is not diagonal, since the frequency response is not rectangular.

    Figure 3.  Frequency response of symmetric orthogonal wavelet.
    Figure 4.  Covariance matrix of decomposition levels using wavelets constructed in the frequency domain.
    Figure 5.  Covariance matrix of decomposition levels using wavelets constructed in the time domain.

    If the covariance matrix has a diagonal form, then the wavelets of different decomposition levels are orthogonal. This is similar to the orthogonal Karhunen-Loève transformation, which leads the covariance matrix to a diagonal form. The diagonal matrix shows that the signal energy after the transformation is concentrated in a few significant wavelet coefficients of the transformation, that is, it is a prerequisite for signal compression. The main disadvantage of the Karhunen-Loève transform is that it is not universal, that is, different covariance matrices and, accordingly, different eigenfunctions are obtained for different types of signals. Also, there are no fast calculation algorithms for large matrices. Figure 6 shows the frequency response of the high-pass filter. The Gibbs phenomenon is clearly visible.

    Figure 6.  Frequency response of the high-pass filter.

    Figure 7 shows the frequency response of high-pass filters synthesized in the time and frequency domains in decibels (logarithmic scale).

    Figure 7.  Frequency response of the high-pass filter synthesized in the time and frequency domains in decibels.

    Up to a frequency of 128 units, the frequency response of the filter synthesized in the time domain is presented, and from 129 to 256–the filter synthesized in the frequency domain. The coefficients of the impulse response of the filter are calculated by the formula [6]:

    bN+k=1N+1Nj=N+12cosπk(j+0.5)N+1

    Figure 7 clearly shows how much the frequency characteristics of these filters differ when compared on the same scale. For a filter synthesized in the time domain, the Gibbs phenomenon is also observed. Figure 8 shows the frequency response with two band width in decibels. It can be said that the wavelets or digital filters obtained in the frequency domain have an ideal frequency response within the calculation error.

    Figure 8.  Frequency response of a filter with two passbands in decibels.

    Algorithms for obtaining filters are presented in [7]. But filters are synthesized in the time domain, which leads to a transition band, and therefore a rectangular frequency response is not obtained.

    Multiple-scale image analysis is possible not only with the use of the Mallat algorithm. Multiple-scale image analysis can be carried out both with wavelets based on derivatives of the Gaussian function and with wavelets constructed in the frequency domain, that is, decompose and reconstruct images. A correlation type measure was used to quantify the proximity between the reconstructed signal and the original signal. The calculated value of the Pearson correlation coefficient of the signal and the reconstructed signal was 0.999. The reconstructed images are no different from the original images and are better than for the Mallat algorithm.

    The developed algorithms using FFT made it possible to reduce the calculation time of WT by four orders of magnitude compared to direct numerical integration:

    W(a,b)=1aS(t)Ψ(tba)dt,

    where a is the scale factor, b is the shift parameter. Algorithms for inverse and direct WT in the frequency domain are presented in [8,9].

    Wavelets with rectangular frequency response made it possible to reduce the calculation time of direct WT in the frequency domain by 2 times compared to when wavelets based on derivatives of the Gaussian function were used. Like the inverse FT, there is an inverse continuous WT:

    S(t)=C1Ψ0Ψ(tba)W(a,b)dadba3+k,

    where CΨ–normalizing coefficient:

    CΨ=|FΨ(ω)|2ω1dω<,

    FΨ(ω)–Fourier spectrum of the basis function, k–indicator of the degree of the scale multiplier.

    Also, such wavelets made it possible to reduce the calculation time of the inverse WT signal with a sample size of 32,768 and 262,144 samples by 260 and 5000 times, respectively, compared with the FFT algorithm. The construction of symmetric and antisymmetric wavelets with a rectangular frequency response allowed the inverse WT to be calculated at least 10,000,000 times faster than with direct numerical integration. Profiling was carried out for a Celeron® processor with a frequency of 2.54 Ghz.

    In contrast to the Mallat algorithm, the algorithm developed by the authors allows us to obtain a much larger number of decomposition levels, which allows us to study the image in more detail [3]. When using this algorithm, mosaicity does not appear when approximating the image. Figure 9(a) shows a 512 × 512 pixel color image reconstructed with the approximating coefficients of the fourth level for the algorithm in the frequency domain. In this case, a wavelet based on the Gaussian function of the 2nd order (MHAT-wavelet) is used.

    Figure 9.  Reconstruction of the image with approximating coefficients of the fourth level: (a) the reconstructed image with the approximation coefficients of the fourth level for the algorithm in the frequency domain (b) the reconstructed image with the approximation coefficients of the fourth level for the Mallat algorithm.

    Here, the scale factor a is 2 for comparison with the traditional Mallat transformation. For the developed algorithm, there is no need for approximating and detailing coefficients, there are only decomposition levels corresponding to the decomposition levels in the Mallat algorithm, and thus it becomes possible to compare the decomposition results. Figure 9(b) shows a reconstructed image with approximating coefficients of the fourth level. For the Mallat algorithm, a Daubechies db2 wavelet is used. The calculation was carried out using the MatLab application software package. In Figure 9(b) mosaicity is clearly visible. Image reconstruction with detailing coefficients also, when using the algorithm in the frequency domain, gives a clearer image than in the MatLab computer mathematics system (Mallat's algorithm). In Figure 10(a) a reconstructed image with the detailing coefficients of the first level for the algorithm in the frequency domain is presented. Figure 10(b) shows a reconstructed image with the detailing coefficients of the first level for the Mallat algorithm using the Daubechies wavelet (db2). Based on the developed algorithm in the frequency domain, in contrast to the discrete WT, it is possible to conduct multiscale image analysis with a multiplicity less than 2. This multi-scale analysis allows you to explore the image in a wide scale range, decomposing the image into dozens of levels. When moving from one level to another, the change in the image is visually barely noticeable. Figure 11 shows a multiscale image analysis with a multiplicity less than 2.

    Figure 10.  Reconstruction of the image with detailing coefficients of the first level: (a) the reconstructed image with the detailing coefficients of the first level for the algorithm in the frequency domain, (b) the reconstructed image with the detailing coefficients of the first level for the Mallat algorithm.
    Figure 11.  Multiscale image analysis with a multiplicity less than 2.

    In Figure 11(a), (b), it is clearly noticeable that there are no colors at a small scale factor, the contour of the image stands out well. We also refer the reader to problematics of image edge detection based on singular value feature vector and gradient operator [10].

    Orthogonal symmetric and antisymmetric wavelets can also increase the spectral resolution. Figure 12 shows the results of the wavelet transform of the sum of two sinusoids with frequencies slightly different from each other.

    Figure 12.  A slice of the wavelet transform with derivatives of the Gaussian function.

    In Figure 12(a) uses the MNAT wavelet, that is, the second derivative of the Gaussian function, in Figure 12(b)–the third derivative of the Gaussian function, and in Figure 12(c)–the fourth derivative of the Gaussian function. For the fourth-order derivative of the Gaussian function, the resolution is better. Figure 13 shows the result of a wavelet transform of the same sum of sinusoids using an orthogonal symmetric wavelet constructed in the frequency domain.

    Figure 13.  A slice of the wavelet transform based on an orthogonal symmetric wavelet.

    The resolution of this wavelet is much higher than for wavelets based on derivatives of Gaussian functions. Figure 14 shows a slice of the wavelet transform for the sum of sinusoids with closer frequencies. For wavelets based on derivatives of the Gaussian function, these sinusoids are not resolved at all, that is, they are allocated as one sinusoid.

    Figure 14.  A slice of the wavelet transform based on an orthogonal symmetric wavelet.

    Despite the fact that the conversion time using the Mallat algorithm is almost the same with the conversion time of the algorithm in the frequency domain, the image quality in the case of the implementation of the Mallat algorithm is much worse. When the wavelet order (dbN) is increased or other discrete wavelets are used, the mosaicity decreases, but the image quality remains significantly worse compared to the results when using wavelets based on derivatives of the Gaussian function and wavelets constructed in the frequency domain. Image reconstruction with detailing coefficients when using the algorithm in the frequency domain also gives a clearer image compared to the image obtained using the MatLab application software package. When reconstructing an image using all levels in MatLab, many colors are lost, when applying the algorithm in the frequency domain, the color gamut is preserved, the reconstructed image does not differ from the original.

    The scientific literature does not present algorithms for multiscale analysis with a multiplicity less than 2. All papers describe signal processing based on discrete wavelet transform: papers [11,12,13,14] describe digital filter design sequence, papers [15,16,17] describe image processing. Among the papers using continuous wavelet transformation, we can note: [18] for processing seismic information, [19] for defect detection, [20] for signature verification, [21] for adaptive wavelet denoising, [22,23] for chemical analysis. In these papers, non-orthogonal wavelets are used and the transformation does not occur in the frequency domain, i.e., without the use of FFT. When compressing signals, noise suppression, recognition and verification of objects, multi-scale analysis of signals in the time domain with a multiplicity equal to 2 is used. The use of multi-scale analysis in the frequency domain makes it possible to reconstruct the signal with greater accuracy. An increase in the number of decomposition levels means the use of bandpass filters with a reduced frequency range, which leads to more effective noise suppression. The construction of wavelets in the frequency domain allows us to obtain the maximum possible number of initial zero moments for a given sample. To obtain them in the time domain, it is necessary to solve a system with the same number of equations (more than 100). Obtaining wavelets with a large number of initial zero moments is the basis for the concentration of signal information in a few significant wavelet coefficients and thus serves as the basis for increasing the signal compression ratio.

    MSA in the frequency domain is preferable compared to MSA in the time domain, since wavelets based on derivatives of the Gaussian function have a linear phase-frequency characteristic. In addition, wavelets constructed in the frequency domain have an ideal amplitude-frequency response. In this regard, the accuracy of signal reconstruction increases, that is, the transformation is truly orthogonal.

    The authors declare no conflict of interest.



    [1] A. L. De Gennaro, C. Bernard, Semi-analytical prices for lookback and barrier options under the Heston model, Decis. Econ. Financ., 42 (2019), 715–741. https://doi.org/10.1007/s10203-019-00254-x doi: 10.1007/s10203-019-00254-x
    [2] A. Basso, P. Pianca, Correction simulation bias in discrete monitoring of Russian options. Available from: https://www.sci.unich.it/convegni/2000/wmfgen00/basso.ps.
    [3] F. Black, M. Scholes, The pricing of options and corporate liabilities, J. Polit. Econ., 81 (1973), 637–654. https://doi.org/10.1142/9789814759588_0001 doi: 10.1142/9789814759588_0001
    [4] S. Y. Choi, J. P. Fouque, J. H. Kim, Option pricing under hybrid stochastic and local volatility, Quant. Financ., 13 (2013), 1157–1165. https://doi.org/10.1080/14697688.2013.780209 doi: 10.1080/14697688.2013.780209
    [5] L. Clewlow, J. Llanos, C. Strickland, Pricing exotic options in a Black-Scholes world, Financial Operations Research Centre, University of Warwick, 1994. Available from: https://warwick.ac.uk/fac/soc/wbs/subjects/finance/research/wpaperseries/1994/94-54.pdf.
    [6] A. Conze, R. Vishwanathan, Path-dependent options: The case of lookback options, J. Financ., 46 (1991), 1893–1907. https://doi.org/10.2307/2328577 doi: 10.2307/2328577
    [7] J. Cox, Notes on option pricing I: constant elasticity of variance diffusions, Standford University, Graduate School of Business, 1975.
    [8] J. Cox, S. Ross, The valuation of options for alternative stochastic processes, J. Financ. Econ., 3 (1976), 145–166. https://doi.org/10.1016/0304-405X(76)90023-4 doi: 10.1016/0304-405X(76)90023-4
    [9] D. Davydov, V. Linetsky, Pricing and hedging path-dependent options under the CEV process, Manag. Sci., 47 (2001), 881–1027. https://doi.org/10.1287/mnsc.47.7.949.9804 doi: 10.1287/mnsc.47.7.949.9804
    [10] M. Escobar-Anel, W. Fan, The SEV-SV model–-applications in portfolio optimization, Risks, 11 (2023), 30. https://doi.org/10.3390/risks11020030 doi: 10.3390/risks11020030
    [11] A. D. Fitt, P. Wilmott, J. N. Dewynne, An integral equation for the value of a stop-loss option, In: Proceedings of Seventh European Conference on Mathematics in Industry, 1994. Available from: https://www.brookes.ac.uk/getmedia/2991306b-5452-4c52-9074-62355a91dbc8/pub23.pdf.
    [12] J. P. Fouque, C. H. Han, Variance reduction for Monte Carlo methods to evaluate option prices under multi-factor stochastic volatility models, Quant. Financ., 4 (2004), 597–606. Available form: https://www.tandfonline.com/doi/abs/10.1080/14697680400020317?journalCode = rquf20.
    [13] J. P. Fouque, G. Papanicolaou, R. Sircar, K. Solna, Multiscale stochastic volatility asymptotics, SIAM J. Multiscale Model. Simul., 2 (2003), 22–42. https://doi.org/10.1137/030600291 doi: 10.1137/030600291
    [14] J. P. Fouque, G. Papanicolaou, R. Sircar, K. Solna, Multiscale stochastic volatility for equity, interest rate, and credit derivatives, Cambridge University Press, Cambridge, 2011.
    [15] J. P. Fouque, M. Lorig, R. Sircar, Second order multiscale stochastic volatility asymptotics: Stochastic terminal layer analysis & calibration, Financ. Stoch., 20 (2016), 543–588. https://doi.org/10.48550/arXiv.1208.5802 doi: 10.48550/arXiv.1208.5802
    [16] M. B. Goldman, H. B. Sosin, M. A. Gatto, Path dependent options: "Buy at the low, sell at the high", J. Financ., 34 (1979), 1111–1127. https://doi.org/10.2307/2327238 doi: 10.2307/2327238
    [17] P. S. Hagan, D. Kumar, A. S. Kesniewski, D. E. Woodward, Managing smile risk, Wilmott, 1 (2002), 84–108.
    [18] X. J. He, S. Lin, Analytically pricing exchange options with stochastic liquidity and regime switching, J. Futures Markets, 43 (2023), 662–676. https://doi.org/10.1002/fut.22403 doi: 10.1002/fut.22403
    [19] X. J. He, S. Lin, Analytically pricing European options under a hybrid stochastic volatility and interest rate model with a general correlation structure, J. Futures Markets, 43 (2023), 951–967. https://doi.org/10.1002/fut.22421 doi: 10.1002/fut.22421
    [20] T. Kato, A. Takahashi, T. Yamada, An asymptotic expansion formula for up-and-out barrier option price under stochastic volatility model, JSIAM Lett., 5 (2013), 17–20.
    [21] D. Kim, J. H. Yoon, C. R. Park, Pricing external barrier options under a stochastic volatility model, J. Comput. Appl. Math., 394 (2021), 113555. https://doi.org/10.1016/j.cam.2021.113555 doi: 10.1016/j.cam.2021.113555
    [22] J. H. Kim, J. Lee, S. P. Zhu, S. H. Yu, A multiscale correction to the Black-Scholes formula, Appl. Stoch. Model. Bus., 36 (2014), 753–765. https://doi.org/10.1002/asmb.2006 doi: 10.1002/asmb.2006
    [23] J. H. Kim, J. H. Yoon, J. Lee, S. Y. Choi, On the stochastic elasticity of variance diffusions, Econom. Model., 51 (2015), 263–268. https://doi.org/10.1016/j.econmod.2015.08.011 doi: 10.1016/j.econmod.2015.08.011
    [24] M. K. Lee, J. H. Kim, American perpetual exotic option prices under stochastic volatility models with constant or stochastic elasticity of variance (a tentative title), Working paper.
    [25] R. Merton, The theory of rational option pricing, Bell J. Econ. Manag. Sci., 4 (1973), 141–183. https://doi.org/10.2307/3003143 doi: 10.2307/3003143
    [26] B. Oksendal, Stochastic differential equations, Springer, New York, 2003.
    [27] S. H. Park, J. H. Kim, Asymptotic option pricing under the CEV diffusion, J. Math. Anal. Appl., 375 (2011), 490–501. https://doi.org/10.1016/j.jmaa.2010.09.060 doi: 10.1016/j.jmaa.2010.09.060
    [28] S. H. Park, J. H. Kim, A semi-analytic pricing formula for lookback options under a general stochastic volatility model, Stat. Probabil. Lett., 83 (2013), 2537–2543. https://doi.org/10.1016/j.spl.2013.08.002 doi: 10.1016/j.spl.2013.08.002
    [29] E. Reiner, M. Rubinstein, Breaking down the barriers, Risk Mag., 4 (1991), 28–35.
    [30] A. G. Ramm, A simple proof of the Fredholm alternative and a characterization of the Fredholm operators, Am. Math. Mon., 108 (2001), 855–860. https://doi.org/10.2307/2695558 doi: 10.2307/2695558
    [31] L. Shepp, A. N. Shiryaev, The Russian option: Reduced regret, Ann. Appl. Probab., 3 (1993), 631–640. Available from: https://www.jstor.org/stable/2959681.
    [32] P. Wilmott, S. Howison, J. Dewynne, The mathematics of financial derivatives: A student introduction, Cambridge University Press, Cambridge, 1995.
  • This article has been cited by:

    1. M. Iida, H. Monobe, H. Murakawa, H. Ninomiya, Vanishing, moving and immovable interfaces in fast reaction limits, 2017, 263, 00220396, 2715, 10.1016/j.jde.2017.04.009
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1636) PDF downloads(91) Cited by(1)

Figures and Tables

Figures(3)  /  Tables(7)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog