Arbitrage Bounds for Prices of Weighted Variance Swaps
AbstractWe develop robust pricing and hedging of a weighted variance swap when market prices for a finite number of co--maturing put options are given. We assume the given prices do not admit arbitrage and deduce no-arbitrage bounds on the weighted variance swap along with super- and sub- replicating strategies which enforce them. We find that market quotes for variance swaps are surprisingly close to the model-free lower bounds we determine. We solve the problem by transforming it into an analogous question for a European option with a convex payoff. The lower bound becomes a problem in semi-infinite linear programming which we solve in detail. The upper bound is explicit. We work in a model-independent and probability-free setup. In particular we use and extend F\"ollmer's pathwise stochastic calculus. Appropriate notions of arbitrage and admissibility are introduced. This allows us to establish the usual hedging relation between the variance swap and the 'log contract' and similar connections for weighted variance swaps. Our results take form of a FTAP: we show that the absence of (weak) arbitrage is equivalent to the existence of a classical model which reproduces the observed prices via risk-neutral expectations of discounted payoffs.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by arXiv.org in its series Papers with number 1001.2678.
Date of creation: Jan 2010
Date of revision: Sep 2012
Contact details of provider:
Web page: http://arxiv.org/
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-01-23 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).
If references are entirely missing, you can add them using this form.