Static arbitrage bounds on basket option prices
نویسندگان
چکیده
We consider the problem of computing upper and lower bounds on the price of an European basket call option, given prices on other similar options. Although this problem is hard to solve exactly in the general case, we show that in some instances the upper and lower bounds can be computed via simple closed-form expressions, or linear programs. We also introduce an efficient linear programming relaxation of the general problem based on an integral transform interpretation of the call price function. We show that this relaxation is tight in some of the special cases examined before.
منابع مشابه
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption of absence of arbitrage, and information about prices of other European basket options on the same underlying assets and with the same maturity. In particular, we provide a simple efficient way to compute this type of...
متن کاملComputing arbitrage upper bounds on basket options in the presence of bid-ask spreads
We study the problem of computing the sharpest static-arbitrage upper bound on the price of a European basket option, given the bid-ask prices of vanilla call options in the underlying securities. We show that this semi-infinite problem can be recast as a linear program whose size is linear in the input data size. These developments advance previous related results, and enhance the practical va...
متن کاملClosed-form solutions to static-arbitrage upper bounds on basket options
We provide a closed-form solution to the problem of computing the sharpest static-arbitrage upper bound on the price of a European basket option, given the prices of vanilla call options in the underlying securities. Unlike previous approaches to this problem, our solution technique is entirely based on linear programming. This also allows us to obtain an efficient (linearsize) linear programmi...
متن کاملStatic versus Dynamic Arbitrage Bounds on Multivariate Option Prices
We compare static arbitrage price bounds on basket calls, i.e. bounds that only involve buy-and-hold trading strategies, with the price range obtained within a multivariate generalization of the [BS73] model. While there is no gap between these two sets of prices in the univariate case, we observe here that contrary to our intuition about model risk for at-the-money calls, there is a somewhat l...
متن کاملStatic-Arbitrage Bounds on the Prices of Basket Options via Linear Programming
We show that the problem of computing sharp upper and lower static-arbitrage bounds on the price of a European basket option, given the prices of other similar options, can be cast as a linear program (LP). The LP formulations readily yield super-replicating (subreplicating) strategies for the upper (lower) bound problem. The dual counterparts of the LP formulations in turn yield underlying ass...
متن کاملS ep 2 00 3 A harmonic analysis solution to the static basket arbitrage problem
We consider the problem of computing upper and lower bounds on the price of a European basket call option, given prices on other similar baskets. We focus here on an interpretation of this program as a generalized moment problem. Recent results by Berg & Maserick (1984), Putinar & Vasilescu (1999) and Lasserre (2001) on harmonic analysis on semigroups, the K-moment problem and its applications ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 106 شماره
صفحات -
تاریخ انتشار 2006