Convex Optimization Over Risk-Neutral Probabilities
From MaRDI portal
Abstract: We consider a collection of derivatives that depend on the price of an underlying asset at expiration or maturity. The absence of arbitrage is equivalent to the existence of a risk-neutral probability distribution on the price; in particular, any risk neutral distribution can be interpreted as a certificate establishing that no arbitrage exists. We are interested in the case when there are multiple risk-neutral probabilities. We describe a number of convex optimization problems over the convex set of risk neutral price probabilities. These include computation of bounds on the cumulative distribution, VaR, CVaR, and other quantities, over the set of risk-neutral probabilities. After discretizing the underlying price, these problems become finite dimensional convex or quasiconvex optimization problems, and therefore are tractable. We illustrate our approach using real options and futures pricing data for the S&P 500 index and Bitcoin.
Recommendations
- Maximum entropy estimates for risk-neutral probability measures with non-strictly-convex data
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach
- Risk-neutral pricing for arbitrage pricing theory
- A linear goal programming method to recover risk neutral probabilities from options prices by maximum entropy
- Recovering risk-neutral probability density functions from options prices using cubic splines and ensuring nonnegativity
This page was built for publication: Convex Optimization Over Risk-Neutral Probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6336209)
