Source: Ann. Appl. Probab. Volume 20, Number 5
(2010), 1891-1906.
In this paper we consider Dynkin’s games with payoffs which are functions of an underlying process. Assuming extended weak convergence of underlying processes {S(n)}n=0∞ to a limit process S we prove convergence Dynkin’s games values corresponding to {S(n)}n=0∞ to the Dynkin’s game value corresponding to S. We use these results to approximate game options prices with path dependent payoffs in continuous time models by a sequence of game options prices in discrete time models which can be calculated by dynamical programming algorithms. In comparison to previous papers we work under more general convergence of underlying processes, as well as weaker conditions on the payoffs.
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription.
Read more about accessing full-text
References
[1] Aldous, D. (1978). Stopping times and tightness. Ann. Probab. 6 335–340.
Mathematical Reviews (MathSciNet):
MR474446
[2] Aldous, D. (1981). Weak convergence of stochastic processes for processes viewed in the strasbourg manner. Unpublished manuscript, Statistics Laboratory Univ. Cambridge.
[3] Amin, K. and Khanna, A. (1994). Convergence of American option values from discrete- to continuous-time financial models. Math. Finance 4 289–304.
[4] Billingsley, P. (1968). Convergence of Probability Measures. Wiley, New York.
Mathematical Reviews (MathSciNet):
MR233396
[5] Cutland, N., Kopp, E. and Willinger, W. (1996). Convergence of Snell Envelopes and Critical Prices in the American Put. Cambridge Univ. Press, Cambridge.
[6] Coquet, F. and Toldo, S. (2007). Convergence of values in optimal stopping and convergence of optimal stopping times. Electron. J. Probab. 12 207–228 (electronic).
[7] Dudley, R. M. (1999). Uniform Central Limit Theorems. Cambridge Studies in Advanced Mathematics 63. Cambridge Univ. Press, Cambridge.
[8] Dolinsky, Y. and Kifer, Y. (2010). Binomial approximations for barrier options of Israeli style. Advances in Dynamic Games XI. To appear.
[9] Jakubowski, A. and Słomiński, L. (1986). Extended convergence to continuous in probability processes with independent increments. Probab. Theory Relat. Fields 72 55–82.
Mathematical Reviews (MathSciNet):
MR835159
[10] Kifer, Y. (2000). Game options. Finance Stoch. 4 443–463.
[11] Kifer, Y. (2006). Error estimates for binomial approximations of game options. Ann. Appl. Probab. 16 984–1033.
[12] Kifer, Y. (2007). Optimal stopping and strong approximation theorems. Stochastics 79 253–273.
[13] Kallsen, J. and Kühn, C. (2005). Convertible bonds: Financial derivatives of game type. In Exotic Option Pricing and Advanced Lévy Models 277–291. Wiley, Chichester.
[14] Lamberton, D. (1993). Convergence of the critical price in the approximation of American options. Math. Finance 3 179–190.
[15] Lepeltier, J. P. and Maingueneau, M. A. (1984). Le jeu de Dynkin en théorie générale sans l’hypothèse de Mokobodski. Stochastics 13 25–44.
Mathematical Reviews (MathSciNet):
MR752475
[16] Lamberton, D. and Pagès, G. (1990). Convergence des re Duites Dune Suite de Processus càdlàg. Les Cahiers du C.E.R.M.A. 11 115–130.
[17] Lamberton, D. and Pagès, G. (1990). Sur l’approximation des réduites. Ann. Inst. H. Poincaré Probab. Statist. 26 331–355.
[18] Mulinacci, S. (2003). American path-dependent options: Analysis and approximations. Rend. Studi Econ. Quant. 93–120.
[19] Mulinacci, S. and Pratelli, M. (1998). Functional convergence of Snell envelopes: Applications to American options approximations. Finance Stoch. 2 311–327.
[20] Meyer, P. A. and Zheng, W. A. (1984). Tightness criteria for laws of semimartingales. Ann. Inst. H. Poincaré Probab. Statist. 20 353–372.
Mathematical Reviews (MathSciNet):
MR771895
[21] Ohtsubo, Y. (1986). Optimal stopping in sequential games with or without a constraint of always terminating. Math. Oper. Res. 11 591–607.
Mathematical Reviews (MathSciNet):
MR865554