首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 109 毫秒
1.
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.  相似文献   

2.
The problem of finding static-arbitrage bounds on basket option prices has received a growing attention in the literature. In this paper, we focus on the lower bound case and propose a novel efficient solution procedure that is based on the separation problem. The computational burden of the proposed method is polynomial in the input data size. We also discuss the case of possibly negative weight vectors which can be applied to spread options.  相似文献   

3.
Given a basket option on two or more assets in a one‐period static hedging setting, the paper considers the problem of maximizing and minimizing the basket option price subject to the constraints of known option prices on the component stocks and consistency with forward prices and treat it as an optimization problem. Sharp upper bounds are derived for the general n‐asset case and sharp lower bounds for the two‐asset case, both in closed forms, of the price of the basket option. In the case n = 2 examples are given of discrete distributions attaining the bounds. Hedge ratios are also derived for optimal sub and super replicating portfolios consisting of the options on the individual underlying stocks and the stocks themselves.  相似文献   

4.
In this paper we propose pricing bounds for European-style discrete arithmetic Asian basket options in a Black and Scholes framework. We start from methods used for basket options and Asian options. First, we use the general approach for deriving upper and lower bounds for stop-loss premia of sums of non-independent random variables as in Kaas et al. [Upper and lower bounds for sums of random variables, Insurance Math. Econom. 27 (2000) 151–168] or Dhaene et al. [The concept of comonotonicity in actuarial science and finance: theory, Insurance Math. Econom. 31(1) (2002) 3–33]. We generalize the methods in Deelstra et al. [Pricing of arithmetic basket options by conditioning, Insurance Math. Econom. 34 (2004) 55–57] and Vanmaele et al. [Bounds for the price of discrete sampled arithmetic Asian options, J. Comput. Appl. Math. 185(1) (2006) 51–90]. Afterwards we show how to derive an analytical closed-form expression for a lower bound in the non-comonotonic case. Finally, we derive upper bounds for Asian basket options by applying techniques as in Thompson [Fast narrow bounds on the value of Asian options, Working Paper, University of Cambridge, 1999] and Lord [Partially exact and bounded approximations for arithmetic Asian options, J. Comput. Finance 10 (2) (2006) 1–52]. Numerical results are included and on the basis of our numerical tests, we explain which method we recommend depending on moneyness and time-to-maturity.  相似文献   

5.
Static super-replicating strategies for a class of exotic options   总被引:1,自引:1,他引:0  
In this paper, we investigate static super-replicating strategies for European-type call options written on a weighted sum of asset prices. This class of exotic options includes Asian options and basket options among others. We assume that there exists a market where the plain vanilla options on the different assets are traded and hence their prices can be observed in the market. Both the infinite market case (where prices of the plain vanilla options are available for all strikes) and the finite market case (where only a finite number of plain vanilla option prices are observed) are considered. We prove that the finite market case converges to the infinite market case when the number of observed plain vanilla option prices tends to infinity.We show how to construct a portfolio consisting of the plain vanilla options on the different assets, whose pay-off super-replicates the pay-off of the exotic option. As a consequence, the price of the super-replicating portfolio is an upper bound for the price of the exotic option. The super-hedging strategy is model-free in the sense that it is expressed in terms of the observed option prices on the individual assets, which can be e.g. dividend paying stocks with no explicit dividend process known. This paper is a generalization of the work of Simon et al. [Simon, S., Goovaerts, M., Dhaene, J., 2000. An easy computable upper bound for the price of an arithmetic Asian option. Insurance Math. Econom. 26 (2–3), 175–184] who considered this problem for Asian options in the infinite market case. Laurence and Wang [Laurence, P., Wang, T.H., 2004. What’s a basket worth? Risk Mag. 17, 73–77] and Hobson et al. [Hobson, D., Laurence, P., Wang, T.H., 2005. Static-arbitrage upper bounds for the prices of basket options. Quant. Fin. 5 (4), 329–342] considered this problem for basket options, in the infinite as well as in the finite market case.As opposed to Hobson et al. [Hobson, D., Laurence, P., Wang, T.H., 2005. Static-arbitrage upper bounds for the prices of basket options. Quant. Fin. 5 (4), 329–342] who use Lagrange optimization techniques, the proofs in this paper are based on the theory of integral stochastic orders and on the theory of comonotonic risks.  相似文献   

6.
The Black–Scholes formula is often used in the backward direction to invert the implied volatility, usually with some solver method. Solver methods, being aesthetically unappealing, are also slower than closed-form approximations. However, closed-form approximations in previous works lack accuracy, often providing option pricing errors well exceeding the bid–ask spreads. We develop a new closed-form method based on the rational approximation. The rational approximation is much faster than typical solver methods and very accurate for both at-the-money and away-from-the-money options. Its accuracy can be further improved by one or two steps of Newton–Raphson iterations.  相似文献   

7.
We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.  相似文献   

8.
We demonstrate how the problem of determining the ask price for electricity swing options can be considered as a stochastic bilevel program with asymmetric information. Unlike as for financial options, there is no way for basing the pricing method on no-arbitrage arguments. Two main situations are analyzed: if the seller has strong market power he/she might be able to maximize his/her utility, while in fully competitive situations he/she will just look for a price which makes profit and has acceptable risk. In both cases the seller has to consider the decision problem of a potential buyer – the valuation problem of determining a fair value for a specific option contract – and anticipate the buyer’s optimal reaction to any proposed strike price. We also discuss some methods for finding numerical solutions of stochastic bilevel problems with a special emphasis on using duality gap penalizations.  相似文献   

9.
We formulate the fixed-charge multiple knapsack problem (FCMKP) as an extension of the multiple knapsack problem (MKP). The Lagrangian relaxation problem is easily solved, and together with a greedy heuristic we obtain a pair of upper and lower bounds quickly. We make use of these bounds in the pegging test to reduce the problem size. We also present a branch-and-bound (B&B) algorithm to solve FCMKP to optimality. This algorithm exploits the Lagrangian upper bound as well as the pegging result for pruning, and at each terminal subproblem solve MKP exactly by invoking MULKNAP code developed by Pisinger [Pisinger, D., 1999. An exact algorithm for large multiple knapsack problems. European Journal of Operational Research 114, 528–541]. As a result, we are able to solve almost all test problems with up to 32,000 items and 50 knapsacks within a few seconds on an ordinary computing environment, although the algorithm remains some weakness for small instances with relatively many knapsacks.  相似文献   

10.
We generalize the notion of arbitrage based on the coherent risk measure, and investigate a mathematical optimization approach for tightening the lower and upper bounds of the price of contingent claims in incomplete markets. Due to the dual representation of coherent risk measures, the lower and upper bounds of price are located by solving a pair of semi-infinite linear optimization problems, which further reduce to linear optimization when conditional value-at-risk (CVaR) is used as risk measure. We also show that the hedging portfolio problem is viewed as a robust optimization problem. Tuning the parameter of the risk measure, we demonstrate by numerical examples that the two bounds approach to each other and converge to a price that is fair in the sense that seller and buyer face the same amount of risk.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号