Binomial Approximations for Barrier Options of Israeli Style

  • Yan Dolinsky
  • Yuri Kifer
Part of the Annals of the International Society of Dynamic Games book series (AISDG, volume 11)


We show that prices and shortfall risks of game (Israeli) barrier options in a sequence of binomial approximations of the Black–Scholes (BS) market converge to the corresponding quantities for similar game barrier options in the BS market with path dependent payoffs and we estimate the speed of convergence. The results are also new for usual American style options and they are interesting from a computational point of view, since in binomial markets these quantities can be obtained via dynamic programming algorithms. The paper extends [6] and [3] but requires substantial additional arguments in view of peculiarities of barrier options which, in particular, destroy the regularity of payoffs needed in the above papers.


Stock Price Option Price Open Interval Initial Capital Barrier Option 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cox, J.C., Ross, R.A., Rubinstein, M.: Option pricing: a simplified approach. J. Financ. Econom. 7, 229–263 (1976)CrossRefGoogle Scholar
  2. 2.
    Dolinsky, Y., Kifer, Y.: Hedging with risk for game options in discrete time. Stochastics 79, 169–195 (2007)MATHMathSciNetGoogle Scholar
  3. 3.
    Dolinsky, Y., Kifer, Y.: Binomial approximations of shortfall risk for game options. Ann. Appl. Probab. 18, 1737–1770 (2008)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Karatzas, I., Shreve, S.E.: Brownian motion and Stochastic calculus. Springer, New York (1991)MATHGoogle Scholar
  5. 5.
    Kifer, Y.: Game options. Finance and Stoch. 4, 443–463 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Kifer, Y.: Error estimates for binomial approximiations of game options. Ann. Appl. Probab. 16, 984–1033 (2006); Correction: 18, 1271–1277 (2008)Google Scholar
  7. 7.
    Ohtsubo,: Optimal stopping in sequential games with or without a constraint of always terminating. Math. Oper Res. 11, 591–607 (1986)Google Scholar
  8. 8.
    Rogers, L.C.G., Stapelton, E.J.: Fast accurate binomial pricing. Finance and Stoch. 2, 3–17 (1998)MATHCrossRefGoogle Scholar
  9. 9.
    Shiryaev, A.N., Kabanov, Y.M., Kramkov, D.O., Melnikov, A.B.: To the theory of computations of European and American options, discrete case. Th. Probab. Appl. 39, 14–60 (1994); Continuous case. Th. Probab. Appl. 39, 61–102 (1994)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Institute of MathematicsThe Hebrew UniversityJerusalemIsrael

Personalised recommendations