Another Correction. Error estimates for Binomial approximations of game options
英文摘要:
The Annals of Applied Probability 16 (2006) 984--1033 [URL: http://projecteuclid.org/euclid.aoap/1151592257]
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
Yan Dolinsky, Yuri Kifer
The Annals of Applied Probability 16 (2006) 984--1033 [URL: http://projecteuclid.org/euclid.aoap/1151592257]
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
继续探索
We construct algorithms via binomial approximations for computation of prices of game put options and obtain estimates of approximation errors.
Correction for Error estimates for binomial approximations of game options [math.PR/0607123]
We justify and give error estimates for binomial approximations of game (Israeli) options in the Black--Scholes market with Lipschitz continuous path dependent payoffs which are new also for usual American style options. We show also that rational (optimal) exercise times and hedging self-financing portfolios of binomial approximations yield for game options in the Black--Scholes market ``nearly'' rational exercise times and ``nearly'' hedging self-financing portfolios with small average shortfalls and initial capitals close to fair prices of the options. The estimates rely on strong invarianc…
We show that the shortfall risk of binomial approximations of game (Israeli) options converges to the shortfall risk in the corresponding Black--Scholes market considering Lipschitz continuous path-dependent payoffs for both discrete- and continuous-time cases. These results are new also for usual American style options. The paper continues and extends the study of Kifer [Ann. Appl. Probab. 16 (2006) 984--1033] where estimates for binomial approximations of prices of game options were obtained. Our arguments rely, in particular, on strong invariance principle type approximations via the Skorok…
In this article, we study the rate of convergence of prices when a model is approximated by some simplified model. We also provide a method how explicit error formula for more general options can be obtained if such formula is available for digital option prices. We illustrate our results by considering convergence of binomial prices to Black-Scholes prices. We also consider smooth convergence in which the approximation does not oscillate for general class of payoff functions.
We start briefly surveying research on optimal stopping games since their introduction by E.B.Dynkin more than 40 years ago. Recent renewed interest to dynkin's games is due, in particular, to the study of Israeli (game) options introduced in 2000. We discuss the work on these options and related derivative securities for the last decade. Among various results on game options we consider error estimates for their discrete approximations, swing game options, game options in markets with transaction costs and other questions.
We construct algorithms for computation of prices and superhedging strategies for game options in general discrete markets both from the seller and the buyer points of view.
An Entropy Regularized BSDE Approach to Bermudan Options and Games
本文通过熵正则化反射倒向随机微分方程研究百慕大期权和博弈期权的最优停止问题,提出基于策略改进的强化学习算法并证明其收敛性,同时给出神经网络数值求解方案。
We introduce a setup of model uncertainty in discrete time. In this setup we derive dual expressions for the super--replication prices of game options with upper semicontinuous payoffs. We show that the super--replication price is equal to the supremum over a special (non dominated) set of martingale measures, of the corresponding Dynkin games values. This type of results is also new for American options.
In this paper we study the nonzero-sum Dynkin game in continuous time which is a two player non-cooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we consider the problem of pricing American game contingent claims by the utility maximization approach.
In this paper we introduce a numerical method for optimal stopping in the framework of one dimensional diffusion. We use the Skorokhod embedding in order to construct recombining tree approximations for diffusions with general coefficients. This technique allows us to determine convergence rates and construct nearly optimal stopping times which are optimal at the same rate. Finally, we demonstrate the efficiency of our scheme with several examples of game options.
Game (Israeli) options in a multi-asset market model with proportional transaction costs are studied in the case when the buyer is allowed to exercise the option and the seller has the right to cancel the option gradually at a mixed (or randomised) stopping time, rather than instantly at an ordinary stopping time. Allowing gradual exercise and cancellation leads to increased flexibility in hedging, and hence tighter bounds on the option price as compared to the case of instantaneous exercise and cancellation. Algorithmic constructions for the bid and ask prices, and the associated superhedging…
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}^{\infty}$ to a limit process $S$ we prove convergence Dynkin's games values corresponding to $\{S^{(n)}\}_{n=0}^{\infty}$ 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 pr…
We study pricing and superhedging strategies for game options in an imperfect market with default. We extend the results obtained by Kifer in \cite{Kifer} in the case of a perfect market model to the case of an imperfect market with default, when the imperfections are taken into account via the nonlinearity of the wealth dynamics. We introduce the {\em seller's price} of the game option as the infimum of the initial wealths which allow the seller to be superhedged. We {prove} that this price coincides with the value function of an associated {\em generalized} Dynkin game, recently introduced i…
We obtain error estimates for strong approximations of a diffusion with a diffusion matrix $σ$ and a drift b by the discrete time process defined recursively X_N((n+1)/N) = X_N(n/N)+N^{1/2}σ(X_N(n/N))ξ(n+1)+N^{-1}b(XN(n/N)); where ξ(n); n\geq 1 are i.i.d. random vectors, and apply this in order to approximate the fair price of a game option with a diffusion asset price evolution by values of Dynkin's games with payoffs based on the above discrete time processes. This provides an effective tool for computations of fair prices of game options with path dependent payoffs in a multi asset market w…
The aim of this paper is twofold. First, we extend the results of [33] concerning the existence and uniqueness of second-order reflected 2BSDEs to the case of two obstacles. Under some regularity assumptions on one of the barriers, similar to the ones in [10], and when the two barriers are completely separated, we provide a complete wellposedness theory for doubly reflected second-order BSDEs. We also show that these objects are related to non-standard optimal stopping games, thus generalizing the connection between DRBSDEs and Dynkin games first proved by Cvitanic and Karatzas [11]. More prec…
Mean field games with option to buy information
研究连续时间有限时域平均场博弈,其中代表性玩家的目标函数依赖于隐藏状态,玩家可选择付费观察该状态,通过连接最优控制与自由停止模型给出解的表征和显式示例。
This paper considers binomial approximation of continuous time stochastic processes. It is shown that, under some mild integrability conditions, a process can be approximated in mean square sense and in other strong metrics by binomial processes, i.e., by processes with fixed size binary increments at sampling points. Moreover, this approximation can be causal, i.e., at every time it requires only past historical values of the underlying process. In addition, possibility of approximation of solutions of stochastic differential equations by solutions of ordinary equations with binary noise is e…
The aim of this short note is to fill in a gap in our earlier paper [16] on 2BSDEs with reflections, and to explain how to correct the subsequent results in the second paper [15]. We also provide more insight on the properties of 2RBSDEs, in the light of the recent contributions [13, 23] in the so--called $G-$framework.
We develop an option pricing model based on a tug-of-war game. This two-player zero-sum stochastic differential game is formulated in the context of a multi-dimensional financial market. The issuer and the holder try to manipulate asset price processes in order to minimize and maximize the expected discounted reward. We prove that the game has a value and that the value function is the unique viscosity solution to a terminal value problem for a parabolic partial differential equation involving the non-linear and completely degenerate infinity Laplace operator.
Phase transition in percolation games on rooted Galton-Watson trees
该文研究有根Galton-Watson树上的边、点渗流博弈,推导玩家胜负平概率表达式与平局为0的充要条件,分析不同后代分布下的相变现象,并建立与概率树自动机的联系以刻画其遍历性区域。
We investigate upper and lower hedging prices of multivariate contingent claims from the viewpoint of game-theoretic probability and submodularity. By considering a game between "Market" and "Investor" in discrete time, the pricing problem is reduced to a backward induction of an optimization over simplexes. For European options with payoff functions satisfying a combinatorial property called submodularity or supermodularity, this optimization is solved in closed form by using the Lovász extension and the upper and lower hedging prices can be calculated efficiently. This class includes the opt…
In 2002, Benjamin Jourdain and Claude Martini discovered that for a class of payoff functions, the pricing problem for American options can be reduced to pricing of European options for an appropriately associated payoff, all within a Black-Scholes framework. This discovery has been investigated in great detail by Sören Christensen, Jan Kallsen and Matthias Lenga in a recent work in 2020. In the present work we prove that this phenomenon can be observed in a wider context, and even holds true in a setup of non-linear stochastic processes. We analyse this problem from both probabilistic and ana…
The worst-case Lipschitz constant of an $n$-player $k$-action $δ$-perturbed game, $λ(n,k,δ)$, is given an explicit probabilistic description. In the case of $k\geq 3$, $λ(n,k,δ)$ is identified with the passage probability of a certain symmetric random walk on $\mathbb Z$. In the case of $k=2$ and $n$ even, $λ(n,2,δ)$ is identified with the probability that two two i.i.d.\ Binomial random variables are equal. The remaining case, $k=2$ and $n$ odd, is bounded through the adjacent (even) values of $n$. Our characterisation implies a sharp closed form asymptotic estimate of $λ(n,k,δ)$ as $δn /k\to…
Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze GCCs like their European and American counterparts by solving option holder's and writer's optimal investment problems in the underlying securities. By this, partial hedging opportunities are taken into account. We extend results in the literature by solving the stochastic game corresponding to GCCs with both continuous time stopping and trading. Namely, we …
In this expository paper we illustrate the generality of game theoretic probability protocols of Shafer and Vovk (2001) in finite-horizon discrete games. By restricting ourselves to finite-horizon discrete games, we can explicitly describe how discrete distributions with finite support and the discrete pricing formulas, such as the Cox-Ross-Rubinstein formula, are naturally derived from game-theoretic probability protocols. Corresponding to any discrete distribution with finite support, we construct a finite-horizon discrete game, a replicating strategy of Skeptic, and a neutral forecasting st…
We derive error estimates for multinomial approximations of American options in a multidimensional jump--diffusion Merton's model. We assume that the payoffs are Markovian and satisfy Lipschitz type conditions. Error estimates for such type of approximations were not obtained before. Our main tool is the strong approximations theorems for i.i.d. random vectors which were obtained [14]. For the multidimensional Black--Scholes model our results can be extended also to a general path dependent payoffs which satisfy Lipschitz type conditions. For the case of multinomial approximations of American …
扫码添加微信好友,提出您的宝贵建议 👇
💡 备注请填写:网站反馈
发表机构由 AI 从论文文本抽取,如发现错误,欢迎反馈修正建议。