Model-Free Bounds¶
Introduction¶
Model-free bounds represent a fundamental approach to derivative pricing that does not rely on specific assumptions about the underlying asset's dynamics. Instead, these bounds are derived purely from no-arbitrage principles and observable market prices, making them robust to model misspecification.
The theory of model-free bounds addresses the question: What can we say about derivative prices using only no-arbitrage and observed option prices, without specifying a stochastic process?
This approach is particularly valuable because: 1. It provides rigorous bounds that must hold regardless of the true underlying model 2. It identifies which information is truly necessary for pricing 3. It reveals when the market provides sufficient constraints to pin down unique prices 4. It offers model-independent hedging strategies
Mathematical Framework¶
1. Market Setup¶
Traded Assets: Consider a frictionless market with: - A riskless asset (bond) with price \(B_t = e^{rt}\) - A risky asset (stock) with price process \(S_t\) - European options with various strikes and maturities
No-Arbitrage Assumption: There exists no trading strategy that: 1. Requires no initial investment 2. Has non-negative payoff with probability 1 3. Has positive payoff with positive probability
Fundamental Theorem of Asset Pricing: Under no-arbitrage, there exists a probability measure \(\mathbb{Q}\) equivalent to the physical measure \(\mathbb{P}\) such that discounted asset prices are \(\mathbb{Q}\)-martingales:
2. Model-Free Setting¶
Given Information: - Current stock price \(S_0\) - Risk-free rate \(r\) - Maturity \(T\) - Prices of European calls \(C(K)\) for various strikes \(K\)
Unknown: The specific dynamics of \(S_t\) or equivalently, the probability measure \(\mathbb{Q}\).
Goal: Derive bounds on prices of exotic derivatives using only no-arbitrage and observed vanilla option prices.
Static Arbitrage Bounds¶
1. Call Option Bounds¶
Intrinsic Value Bound (Lower Bound):
Proof: Consider the portfolio: - Long one call with strike \(K\) - Short one stock - Long \(Ke^{-rT}\) in bonds
At maturity: - If \(S_T > K\): Portfolio value = \((S_T - K) - S_T + K = 0\) - If \(S_T \leq K\): Portfolio value = \(0 - S_T + K \geq 0\)
The portfolio has non-negative payoff, so by no-arbitrage, its initial value must be non-negative:
Upper Bound:
Proof: A call option cannot be worth more than the underlying stock itself. If \(C(K, T) > S_0\), sell the call and buy the stock for arbitrage.
2. Put Option Bounds¶
Lower Bound:
Upper Bound:
Proof: A put option cannot be worth more than the present value of the strike. If \(P(K, T) > Ke^{-rT}\), sell the put and invest the proceeds for arbitrage.
3. Put-Call Parity¶
Exact Relationship:
Proof: Consider two portfolios: - Portfolio A: One call + \(Ke^{-rT}\) in bonds - Portfolio B: One put + One stock
At maturity \(T\): - If \(S_T > K\): Portfolio A = \((S_T - K) + K = S_T\), Portfolio B = \(0 + S_T = S_T\) - If \(S_T \leq K\): Portfolio A = \(0 + K = K\), Portfolio B = \((K - S_T) + S_T = K\)
Since both portfolios have identical payoffs, by no-arbitrage, they must have identical prices today.
Convexity and Monotonicity Constraints¶
1. Convexity in Strike¶
Theorem (Convexity): The call price \(C(K)\) is a convex function of the strike \(K\):
for all \(K_1 < K_2\) and \(\lambda \in [0, 1]\).
Proof: For any \(K_1 < K_2 < K_3\) with \(K_2 = \alpha K_1 + (1-\alpha) K_3\), consider the butterfly spread: - Long 1 call at \(K_1\) - Long 1 call at \(K_3\) - Short \(\frac{K_3 - K_1}{K_2 - K_1} = \frac{1}{\alpha}\) calls at \(K_2\)
This portfolio has non-negative payoff everywhere, hence:
which establishes convexity.
Consequence: The call price function must satisfy:
for any \(K_1 < K_2 < K_3\).
2. Monotonicity¶
Theorem (Decreasing in Strike): Call prices are decreasing in strike:
Proof: The payoff \((S_T - K_1)^+ \geq (S_T - K_2)^+\) for all \(S_T\) when \(K_1 < K_2\). By no-arbitrage, \(C(K_1) \geq C(K_2)\).
Call Spread Bound: For \(K_1 < K_2\):
Proof: - Lower bound: From monotonicity - Upper bound: The maximum payoff of a call spread is \(K_2 - K_1\), so its present value is at most \(e^{-rT}(K_2 - K_1)\)
3. Slope Constraints¶
Theorem: The call price function satisfies:
Proof: - Upper bound: Monotonicity (decreasing function) - Lower bound: From call spread bound, taking limits:
$$ \frac{C(K) - C(K + h)}{h} \leq e^{-rT} $$
As \(h \to 0\):
$$ -\frac{\partial C}{\partial K} \leq e^{-rT} $$
Digital Option Connection: Define the digital call:
Then:
and the constraint becomes:
Breeden-Litzenberger Formula¶
1. Risk-Neutral Density Recovery¶
Theorem (Breeden-Litzenberger, 1978): The risk-neutral density is given by:
Proof: Starting from the call option formula:
Differentiate once with respect to \(K\):
Differentiate again:
Implications: 1. Convexity of \(C(K)\) ensures \(q(K) \geq 0\) (probability density) 2. The integral \(\int_0^{\infty} q(K) \, dK = 1\) (normalization) 3. The forward price:
$$ F_0 = \int_0^{\infty} K q(K) \, dK = S_0 e^{rT} $$
2. Practical Implementation¶
Discrete Approximation: With observed call prices \(\{C(K_i)\}_{i=1}^n\):
Interpolation: Use splines or other smooth interpolation methods to obtain a continuous function \(C(K)\), then differentiate numerically.
Regularization: In practice, raw market prices may violate no-arbitrage constraints due to: - Bid-ask spreads - Discrete strikes - Market microstructure noise
Regularized approaches project observed prices onto the space of arbitrage-free prices.
Carr-Madan Formula¶
1. Derivative Payoff Decomposition¶
Theorem (Carr-Madan, 1998): Any twice-differentiable payoff \(g(S_T)\) can be decomposed as:
where \(F = S_0 e^{rT}\) is the forward price.
Proof: Integration by parts applied twice. Start with:
Apply integration by parts:
Continuing and rearranging terms yields the result.
Pricing Formula: Taking expectations under \(\mathbb{Q}\):
Interpretation: - Any derivative can be priced using puts below the forward and calls above the forward - The weights are given by the second derivative of the payoff function - This is a static replication strategy
2. Applications¶
Variance Swap: For the log-contract \(g(S_T) = \log(S_T/F)\):
Hence:
Realized Variance: Under certain conditions:
VIX Construction: The CBOE VIX index uses this formula to compute model-free implied variance.
Model-Free Bounds on Path-Dependent Options¶
1. Forward Start Options¶
Definition: A forward start call option struck at-the-money at time \(t_1\) with maturity \(t_2\):
Model-Free Bound: Using only vanilla options:
Proof (Upper Bound): The forward start option is dominated by a standard call option with the same maturity.
Proof (Lower Bound): More subtle, requires constructing sub-replicating portfolio using European options.
2. Lookback Options¶
Fixed Strike Lookback Call: Payoff is:
Model-Free Bound:
with equality only if volatility is zero.
Tighter Bound: Using convexity:
This bound can be computed from the market prices of vanilla calls.
3. Barrier Options¶
Up-and-Out Call: Payoff is:
where \(H > S_0\) is the barrier level.
Model-Free Bounds: Let \(C_{\text{UO}}\) denote the up-and-out call price.
Lower Bound:
Upper Bound:
Proof: The up-and-out call pays \((S_T - K)^+\) only when \(S_T < H\). This is less valuable than a call spread \((S_T - K)^+ - (S_T - H)^+\).
Static Replication (Under Specific Models): For certain models (e.g., Black-Scholes with constant volatility), exact static replication is possible using vanilla options. However, model-free exact replication is generally not possible for barrier options.
Fundamental Duality¶
1. Primal and Dual Problems¶
Primal Problem (Buyer's Perspective): Minimize the super-replication cost:
Dual Problem: Maximize over all equivalent martingale measures:
where \(\mathcal{M}\) is the set of equivalent martingale measures.
Fundamental Duality Theorem: Under appropriate technical conditions:
Interpretation: - The minimum cost to super-replicate equals the maximum expected discounted payoff over all martingale measures - This provides a dual characterization of derivative prices - Strong duality holds in frictionless markets
2. Sub-Replication¶
Sub-Replication Cost:
Dual Characterization:
Complete Markets: When the market is complete (unique martingale measure):
Incomplete Markets:
with strict inequality reflecting model uncertainty.
Advanced Model-Free Results¶
1. Variance Bounds¶
Model-Free Implied Variance: Define:
Theorem (Carr-Madan): This quantity satisfies:
where \(\sigma_t\) is the instantaneous volatility.
Implication: \(\sigma_{\text{MF}}^2\) provides a lower bound on the expected realized variance:
2. Moment Constraints¶
European Option Prices constrain the moments of the risk-neutral distribution.
Theorem: Given call prices \(\{C(K_i)\}_{i=1}^n\), the risk-neutral distribution \(q(S)\) must satisfy:
for \(k = 0, 1, 2, \ldots\), where:
and higher moments can be computed from option prices using:
Application: These moment constraints can be used to derive bounds on exotic options by optimization over distributions satisfying the constraints.
Robust Pricing with Traded Options¶
1. Constrained Martingale Measures¶
Setup: Suppose European calls \(\{C(K_i)\}_{i=1}^n\) are traded with observed prices.
Martingale Constraint Set: Define:
Robust Pricing: For an exotic derivative with payoff \(g(S_T)\):
Interpretation: The robust price interval \([\underline{V}, \overline{V}]\) contains all prices consistent with no-arbitrage and observed vanilla option prices.
2. Optimization Formulation¶
Dual Problem: The robust bounds can be computed by solving:
subject to: 1. \(q(S) \geq 0\) for all \(S\) 2. \(\int_0^{\infty} q(S) \, dS = e^{-rT}\) 3. \(\int_0^{\infty} S q(S) \, dS = S_0\) 4. \(\int_0^{\infty} (S - K_i)^+ q(S) \, dS = C(K_i)\) for \(i = 1, \ldots, n\)
This is a linear programming problem in infinite dimensions.
Discretization: Approximate by discretizing the state space:
Then solve a finite-dimensional LP with variables \(q_j = q(S_j)\).
3. Extremal Measures¶
Theorem: The extremal measures (achieving the supremum or infimum) are typically discrete with support on at most \(n+2\) points, where \(n\) is the number of traded strikes.
Proof Sketch: By linear programming duality, the optimal solution has at most as many support points as constraints.
Implication: The worst-case or best-case scenario for pricing corresponds to a discrete probability distribution, concentrating mass on a few states.
Applications and Examples¶
1. Example 1: Digital Option Bounds¶
Payoff: Binary option that pays \(1\) if \(S_T > K\), zero otherwise.
Given: Prices of European calls \(C(K_1)\) and \(C(K_2)\) with \(K_1 < K < K_2\).
Model-Free Bound: By convexity:
Rearranging:
For the digital option:
Bounds can be derived using finite differences of observed call prices.
2. Example 2: Variance Swap Replication¶
Variance Swap Payoff: Pays the realized variance:
Model-Free Replication: Using the log-contract:
The variance can be replicated (approximately) by a portfolio of puts and calls.
3. Example 3: Asian Option Bounds¶
Arithmetic Asian Call: Payoff is:
Model-Free Bound (Using Jensen's Inequality):
since:
Tighter Bounds: Can be derived using moment constraints and optimization over distributions.
Computational Methods¶
1. Linear Programming Approach¶
Discretization: Choose a grid \(\{S_j\}_{j=1}^M\) and discretize the density:
LP Formulation:
Sensitivity: Solutions are sensitive to grid choice and number of points \(M\). Use adaptive grids for better accuracy.
2. Semidefinite Programming¶
Moment-Based Approach: Instead of discretizing states, work directly with moments.
Variables: Moments \(\mu_k = \mathbb{E}_{\mathbb{Q}}[S_T^k]\) for \(k = 0, 1, 2, \ldots, K\).
Constraints: 1. Moment sequence corresponds to a valid probability measure (positive semi-definiteness) 2. Martingale constraint: \(\mu_1 = S_0 e^{rT}\) 3. Option pricing constraints from Breeden-Litzenberger
SDP Formulation: The positivity constraint can be expressed as:
Objective: Compute expectation \(\mathbb{E}_{\mathbb{Q}}[g(S_T)]\) as a function of moments.
3. Monte Carlo Methods¶
Scenario Generation: Generate scenarios \(\{S_T^{(i)}\}_{i=1}^N\) from a reference distribution.
Importance Weights: Assign weights \(\{w_i\}_{i=1}^N\) to match market prices:
Entropy Minimization: Choose weights to minimize relative entropy:
subject to pricing constraints.
Solution: Exponential tilting:
where \(\lambda\) is chosen to match constraints.
Limitations and Extensions¶
1. Model-Free Bound Limitations¶
Width of Bounds: For many exotic derivatives, model-free bounds are wide – the interval \([\underline{V}, \overline{V}]\) can be large.
Information Insufficiency: Vanilla option prices alone may not provide tight bounds for: - Strongly path-dependent options (e.g., lookbacks, barriers) - Multi-asset derivatives - Options sensitive to volatility dynamics
Example: For an up-and-out call, the bounds can be:
which is not very informative.
2. Additional Market Information¶
Volatility Surface: Incorporating options at multiple maturities:
tightens bounds significantly for path-dependent options.
Co-monotonicity: Assuming monotonicity relationships between prices at different times can further tighten bounds.
Dividend Information: Knowledge of dividend payments \(\{d_i, t_i\}\) modifies the martingale constraint.
3. Extensions to Multiple Assets¶
Basket Options: Payoff depends on multiple underlyings:
Marginal Constraints: Given marginal option prices for each asset:
Robust Pricing: Optimize over joint distributions with specified marginals:
subject to marginal constraints.
Fréchet-Hoeffding Bounds: Provide bounds based solely on marginals without correlation information.
Summary and Key Insights¶
1. Fundamental Principles¶
-
No-Arbitrage Foundation: Model-free bounds rely purely on the absence of arbitrage, not on specific dynamical assumptions.
-
Static Replication: Many derivatives can be replicated using portfolios of vanilla options, enabling model-independent pricing.
-
Duality: Super-replication costs equal supremum over martingale measures; sub-replication costs equal infimum.
-
Convexity: The call price function's convexity in strike ensures non-negative risk-neutral densities and provides structural constraints.
-
Information Content: Vanilla option prices encode the risk-neutral distribution, accessible via the Breeden-Litzenberger formula.
2. Practical Implications¶
For Traders: - Model-free bounds provide arbitrage-free price ranges - Observed market prices outside these bounds indicate arbitrage opportunities (after transaction costs)
For Risk Managers: - Robust bounds quantify model uncertainty - Worst-case scenarios guide capital allocation
For Researchers: - Model-free results identify which features are truly necessary for pricing - Gaps between model-free bounds and model-specific prices reveal model-dependent risk premiums
3. Open Questions¶
-
Tightness: How to tighten bounds for exotic derivatives using limited additional information?
-
Dynamic Bounds: Extending model-free theory to multi-period settings with intermediate hedging.
-
Computational Efficiency: Faster algorithms for high-dimensional robust pricing problems.
-
Market Microstructure: Incorporating realistic frictions (bid-ask spreads, discrete strikes) into model-free theory.
Model-free bounds represent a cornerstone of robust derivative pricing, providing rigorous constraints that must hold regardless of modeling assumptions. This theory bridges classical arbitrage pricing with modern robust optimization, offering both theoretical insights and practical tools for quantitative finance.
Exercises¶
Exercise 1. Consider a stock with current price \(S_0 = 100\), risk-free rate \(r = 0\), and maturity \(T = 1\). European call prices are observed at strikes \(K = 90, 100, 110\) with prices \(C(90) = 14\), \(C(100) = 8\), and \(C(110) = 4\). Verify that these prices satisfy the convexity constraint, and compute the discrete approximation to the risk-neutral density \(q(K)\) at \(K = 100\) using the Breeden-Litzenberger formula.
Solution to Exercise 1
Convexity check. For strikes \(K_1 = 90 < K_2 = 100 < K_3 = 110\) with prices \(C(90) = 14\), \(C(100) = 8\), \(C(110) = 4\), the convexity (butterfly) condition requires:
With \(K_2 - K_1 = K_3 - K_2 = 10\), so \(\lambda = \frac{K_3 - K_2}{K_3 - K_1} = \frac{1}{2}\):
Since \(C(100) = 8 \leq 9\), the convexity constraint is satisfied. \(\checkmark\)
We can also check monotonicity: \(C(90) = 14 > C(100) = 8 > C(110) = 4\). \(\checkmark\)
And the slope bounds: \(\frac{C(90) - C(100)}{100 - 90} = \frac{6}{10} = 0.6 \leq e^{-rT} = 1\). \(\checkmark\)
Breeden-Litzenberger density. With \(r = 0\), the discrete approximation is:
At \(K = 100\) with \(\Delta K = 10\):
This means the risk-neutral density at \(S_T = 100\) is approximately \(q(100) = 0.02\) per unit of \(S_T\). For an interval of width \(\Delta K = 10\) centered at 100, the probability mass is approximately \(0.02 \times 10 = 0.20\), meaning there is roughly a 20% risk-neutral probability of the stock being near 100 at maturity.
Exercise 2. Prove that put option prices \(P(K)\) are convex in the strike \(K\). That is, for \(K_1 < K_2 < K_3\) with \(K_2 = \lambda K_1 + (1 - \lambda) K_3\), show that
using a no-arbitrage argument based on butterfly spreads with puts.
Solution to Exercise 2
Proof of put convexity via butterfly spreads.
Let \(K_1 < K_2 < K_3\) with \(K_2 = \lambda K_1 + (1 - \lambda) K_3\) where \(\lambda = \frac{K_3 - K_2}{K_3 - K_1}\).
Consider the put butterfly spread: long \(\lambda\) puts at \(K_1\), short 1 put at \(K_2\), long \((1 - \lambda)\) puts at \(K_3\). The terminal payoff is:
We verify this is non-negative in each region:
Case 1: \(S_T \geq K_3\). All puts expire worthless: \(\Pi = 0 \geq 0\).
Case 2: \(K_2 \leq S_T < K_3\). Only the \(K_3\) put is in the money:
Case 3: \(K_1 \leq S_T < K_2\). The \(K_2\) and \(K_3\) puts are in the money:
Since \(K_2 = \lambda K_1 + (1 - \lambda)K_3\):
because \(S_T \geq K_1\).
Case 4: \(S_T < K_1\). All puts are in the money:
Since the butterfly has non-negative payoff everywhere, by no-arbitrage its initial cost must be non-negative:
This gives \(P(K_2) \leq \lambda P(K_1) + (1 - \lambda) P(K_3)\), establishing convexity. \(\square\)
Exercise 3. Using the Carr-Madan decomposition, express the price of a power payoff \(g(S_T) = S_T^2\) in terms of European call and put prices. Compute \(g''(K)\) and write out the resulting integral formula explicitly.
Solution to Exercise 3
Carr-Madan decomposition for \(g(S_T) = S_T^2\).
The general Carr-Madan formula with pivot \(F = S_0 e^{rT}\) is:
For \(g(S_T) = S_T^2\), we compute:
Substituting:
Taking expectations under \(\mathbb{Q}\) and discounting (noting \(\mathbb{E}_\mathbb{Q}[S_T - F] = 0\) by the martingale property):
where \(P(K) = e^{-rT}\mathbb{E}_\mathbb{Q}[(K - S_T)^+]\) and \(C(K) = e^{-rT}\mathbb{E}_\mathbb{Q}[(S_T - K)^+]\) are put and call prices.
Therefore the price of the power payoff is:
The weight \(g''(K) = 2\) is constant, so the power payoff is replicated by a constant portfolio density of puts (below the forward) and calls (above the forward), plus a position in the forward contract.
Exercise 4. Suppose the risk-neutral distribution of \(S_T\) is supported on three points \(\{80, 100, 120\}\) with probabilities \(\{q_1, q_2, q_3\}\). Given that \(S_0 = 100\) and \(r = 0\), write down the constraints that \(q_1, q_2, q_3\) must satisfy (martingale, normalization, non-negativity). Then formulate and solve the linear program that gives the model-free upper bound for the price of a digital option paying \(1\) if \(S_T > 100\).
Solution to Exercise 4
Constraints. With \(S_T \in \{80, 100, 120\}\), probabilities \((q_1, q_2, q_3)\), \(S_0 = 100\), and \(r = 0\):
- Non-negativity: \(q_1, q_2, q_3 \geq 0\)
- Normalization: \(q_1 + q_2 + q_3 = 1\)
- Martingale: \(80q_1 + 100q_2 + 120q_3 = 100\)
From normalization and martingale constraints:
So \(q_1 = q_3 = p\) and \(q_2 = 1 - 2p\) with \(p \in [0, 1/2]\).
Digital option payoff. The digital call pays 1 if \(S_T > 100\), zero otherwise:
Expected payoff:
LP for upper bound:
achieved at \(p = 1/2\), giving \((q_1, q_2, q_3) = (1/2, 0, 1/2)\).
LP for lower bound:
achieved at \(p = 0\), giving \((q_1, q_2, q_3) = (0, 1, 0)\).
Therefore the model-free bounds for the digital call are \([0, 1/2]\).
The extremal measures are:
- Upper bound: \(S_T \in \{80, 120\}\) with equal probability. This is the maximum-entropy binary distribution consistent with the martingale constraint, which assigns the largest possible probability to the event \(\{S_T > 100\}\).
- Lower bound: \(S_T = 100\) with certainty. Under this degenerate model, the stock never exceeds 100 at maturity, so the digital call is worthless.
Exercise 5. For an arithmetic Asian call with payoff \(\left(\frac{1}{2}(S_{T/2} + S_T) - K\right)^+\), explain why the model-free upper bound satisfies
where \(C(K, T/2)\) and \(C(K, T)\) are European call prices at the respective maturities. Under what conditions is this bound tight?
Solution to Exercise 5
Upper bound derivation. By the convexity of \((\cdot)^+\) and the sub-additivity property:
This follows because for any \(a, b, K\):
where the inequality uses the convexity of \(x \mapsto x^+\) and the fact that \(\frac{1}{2}(a - K) + \frac{1}{2}(b - K) = \frac{1}{2}(a - K)^+ + \frac{1}{2}(b - K)^+ - \frac{1}{2}(a - K)^- - \frac{1}{2}(b - K)^-\), but more directly: since \(x^+\) is convex, \(\left(\frac{x_1 + x_2}{2}\right)^+ \leq \frac{x_1^+ + x_2^+}{2}\).
Taking expectations under any risk-neutral measure \(\mathbb{Q}\) and discounting:
This is a model-free upper bound, valid under any martingale model.
When is this bound tight? The bound is tight (equality holds) when:
almost surely. By the condition for equality in Jensen's inequality, this requires that \((S_{T/2} - K)\) and \((S_T - K)\) have the same sign almost surely, meaning either both \(S_{T/2} > K\) and \(S_T > K\), or both \(S_{T/2} \leq K\) and \(S_T \leq K\).
This happens in degenerate cases:
- If \(K = 0\): both terms are always positive (for positive stock prices), so equality holds trivially.
- If \(S_{T/2} = S_T\) almost surely (zero volatility between \(T/2\) and \(T\)): both observations are the same, so both terms have the same sign.
- If the stock price is almost surely above or below \(K\) at both times (e.g., \(K\) is very far out of the money or very deep in the money).
In general, for finite positive volatility and moderate strikes, the bound is strict.
Exercise 6. Show that the model-free implied variance \(\sigma_{\text{MF}}^2\) can be computed from put options alone when \(S_0 = F\) (the forward price equals the current price). Specifically, derive
and explain why in practice this formula uses out-of-the-money options for both puts (\(K < S_0\)) and calls (\(K > S_0\)).
Solution to Exercise 6
Derivation of the model-free implied variance formula.
Starting from the Carr-Madan decomposition for \(g(S_T) = -\log(S_T/S_0)\) with \(F = S_0 e^{rT}\) and \(r = 0\) (so \(F = S_0\)):
since \(g'(K) = -1/K\) and \(g''(K) = 1/K^2\). Taking expectations:
With \(r = 0\) (so \(e^{rT} = 1\)):
The model-free implied variance is defined as:
When \(S_0 = F\) (i.e., \(r = 0\) or equivalently working with forward prices), this is exactly the formula stated in the exercise. \(\checkmark\)
Why out-of-the-money options are used in practice.
The formula splits into puts below \(S_0\) and calls above \(S_0\):
- For \(K < S_0\): use put prices \(P(K)\). These are out-of-the-money puts.
- For \(K > S_0\): use call prices \(C(K)\). These are out-of-the-money calls.
There are two reasons for this choice:
-
Liquidity: Out-of-the-money options are more actively traded than in-the-money options. Using OTM puts for \(K < S_0\) and OTM calls for \(K > S_0\) relies on the most liquid instruments, yielding more reliable price data.
-
Equivalence via put-call parity: By put-call parity (\(C(K) - P(K) = S_0 - Ke^{-rT}\)), one can convert between puts and calls. For \(K < S_0\):
\[ \frac{P(K)}{K^2} = \frac{C(K) - (S_0 - K)}{K^2} \]Using OTM puts directly avoids the subtraction of two large numbers (ITM call price minus intrinsic value), which would amplify measurement errors. Similarly for \(K > S_0\), using OTM calls avoids subtracting intrinsic value from ITM put prices.
This is precisely the methodology used by the CBOE in computing the VIX index.
Exercise 7. Consider a market with two risky assets \(S^{(1)}\) and \(S^{(2)}\) and suppose the marginal distributions of \(S_T^{(1)}\) and \(S_T^{(2)}\) are both uniform on \([80, 120]\) with \(S_0^{(1)} = S_0^{(2)} = 100\). Using Frechet-Hoeffding bounds, derive model-free upper and lower bounds on the price of a spread option with payoff \((S_T^{(1)} - S_T^{(2)})^+\). Explain why the upper bound corresponds to the case of maximal negative correlation between the two assets.
Solution to Exercise 7
Setup. Both marginals are \(\mu_1 = \mu_2 = \text{Uniform}[80, 120]\) with mean 100. The spread option payoff is \((S_T^{(1)} - S_T^{(2)})^+\).
Frechet-Hoeffding bounds. For any joint distribution \(\pi\) with given marginals \(\mu_1\) and \(\mu_2\), the Frechet-Hoeffding bounds on the joint CDF are:
The upper Frechet bound (comonotonic coupling) corresponds to \(S_T^{(2)} = F_2^{-1}(F_1(S_T^{(1)}))\). Since both marginals are identical, comonotonicity means \(S_T^{(1)} = S_T^{(2)}\) a.s.
The lower Frechet bound (countermonotonic coupling) corresponds to \(S_T^{(2)} = F_2^{-1}(1 - F_1(S_T^{(1)}))\). For identical uniform marginals, this gives \(S_T^{(2)} = 200 - S_T^{(1)}\).
Lower bound on spread option price. Under the comonotonic coupling (\(S_T^{(1)} = S_T^{(2)}\)):
So \(\underline{V} = 0\). (This is also trivially a lower bound since \((x)^+ \geq 0\).)
Upper bound on spread option price. Under the countermonotonic coupling (\(S_T^{(2)} = 200 - S_T^{(1)}\)), with \(U = S_T^{(1)} \sim \text{Uniform}[80, 120]\):
This is positive when \(U > 100\), i.e., \(S_T^{(1)} > 100\):
So \(\overline{V} = 10\).
Why the upper bound corresponds to maximal negative correlation.
The countermonotonic coupling has correlation \(\rho = -1\). Under this coupling, when \(S_T^{(1)}\) is high, \(S_T^{(2)}\) is low, maximizing the spread \(S_T^{(1)} - S_T^{(2)}\) and hence the payoff \((S_T^{(1)} - S_T^{(2)})^+\).
More precisely, for the payoff \((S_T^{(1)} - S_T^{(2)})^+\):
- The payoff increases with \(S_T^{(1)}\) and decreases with \(S_T^{(2)}\).
- By the rearrangement inequality, \(\mathbb{E}[f(X)g(Y)]\) is maximized when \(f\) is increasing, \(g\) is decreasing, and \(X, Y\) are countermonotonic.
- Since we want to maximize a function that benefits from \(S_T^{(1)}\) being large when \(S_T^{(2)}\) is small, maximal negative dependence (countermonotonicity) is optimal.
Therefore the model-free bounds on the spread option are \([0, 10]\).