Option Portfolio Management in a Risk-Neutral World
- 1 Moscow State University, Moscow, Russia
- 2 International Monetary Fund, Washington DC, USA
- 3 Synergy University, Moscow, Russia
Abstract
The most commonly used strategy of the speculative investments in options is a statistical arbitrage between the objective underlying price distribution which the price is following and the risk-neutral distribution on the basis of which options were priced. This article investigates an alternative approach which does not demand these two distributions to be different. Instead, it uses a periodical roll-over of an investment horizon with including options of the next expirations in the portfolio. We consider a risk-neutral world where the real distribution coincides with the risk-neutral distribution as a model of the market. In such a market, the expected return from investments in any option portfolio corresponds with the risk-free rate. However, it is possible to construct and manage the portfolio dynamically in such a way that it provides higher return with a probability close to unity or lower return (possibly a large negative return) with a given very low probability. To optimize the portfolio a stochastic program with the approximative safety-first criterion for option portfolio was developed along with the corresponding multinomial scenario tree. The results of the Monte-Carlo simulation of the portfolio management are presented. The very low probability of loss during option portfolio management is provided by the strategy with periodical rolling horizon of the optimization. The developed portfolio management strategy can be used as a basis for constructing trading strategies for the real option markets.
- Shiryaev, A.N. (1999) Essentials of Stochastic Finance: Facts, Models, Theory. Advanced Series on Statistical Sciences and Applied Probability, Vol. 3, World Scientific. https://doi.org/10.1142/3907
- Javaheri, A. (2005) Inside Volatility Arbitrage: The Secrets of Skewness. John Wiley and Sons Inc., New Jersey.
- Lindberg, P. (2010) Optimal Partial Hedging in a Discrete-Time Market as a Knapsack Problem. Mathematical Methods of Operations Research, 72, 433-451. https://doi.org/10.1007/s00186-010-0327-0
- Beraldi, P. and Ruszczynski, A. (2002) A Branch and Bound Method for Stochastic Integer Problems under Probabilistic Constraints. Optimization Methods and Software, 17, 359-382. https://doi.org/10.1080/1055678021000033937
- Campi, M.C. and Gatatti, S. (2011) A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality. Journal of Optimization Theory and Applications, 148, 257-280. https://doi.org/10.1007/s10957-010-9754-6
- Dentcheva, D., Prekopa, A. and Ruszczynski, A. (2000) Concavity and Efficient Points for Discrete Distributions in Stochastic Programming. Mathematical Programming, 89, 55-79. https://doi.org/10.1007/PL00011393
- Nemirovski, A. and Shapiro, A. (2006) Convex Approximations of Chance Constrained Programs. SIAM Journal on Optimization, 17, 969-996. https://doi.org/10.1137/050622328
- Precopa, A. (1970) On Probabilistic Constrained Programming. Proceedings of the Princenton Symposium on Mathematical Programming, Princeton University Press, 113-138.
- Prekopa, A. (1973) Contribution to the Theory of Stochastic Programming. Mathematical Programming, 4, 202-221. https://doi.org/10.1007/BF01584661
- Prekopa, A. (1995) Programming under Probabilistic Constraint and Maximizing Probabilities under Constraints. Mathematics and It’s Applications, 324, 319-371.
- Prekopa, A. (1995) Stochastic Programming. Kluwer Academic Publishers, Boston. https://doi.org/10.1007/978-94-017-3087-7
- Prekopa, A., Vizvari, D. and Badics, T. (1998) Programming under Probabilistic Constraint with Discrete Random Variable In: Giannessi, F., Komlosi, S. and Rapcsak, T., Eds., New Trends in Mathematical Programming, Applied Optimization, Springer, Berlin, 13, 235-255.
- Prekopa, A. (2003) Probabilistic Programming In: Ruszczynski, A. and Shapiro, A., Eds., Handbooks in Operations Research and Management Science, Elsevier, 10. https://doi.org/10.1016/S0927-0507(03)10005-9