Theorem 6, p. 31 — comonotonic inf-convolution of Wasserstein-robust VaRs, (36)–(37), optimal allocation (X, 0, …, 0)
DisprovedTailRiskSharing.RobustVaR.theorem6_robust_var_comonotonicLet be an atomless probability space, and . For a risk measure and , is its robust version over the order- Wasserstein ball, and is the inf-convolution over comonotonic allocations . Consider agents.
- If and , then
- If and , then
- In either setting, the allocation is an optimal comonotonic allocation.
When agents assess risk by Wasserstein-robust VaR and must share a loss comonotonically, it is optimal to give the whole loss to one agent: the one least sensitive to uncertainty (smallest ) when the levels agree, or the one least sensitive to risk (largest ) when the radii agree.
Formalization Note The agents are indexed by Fin (m+1); the paper's agent is index , and is the sum over the successors i.succ, i : Fin m. The orderings are Monotone δs and Antitone αs. The constrained inf-convolution is EReal-valued. The domain is , as in the paper's §8.2, and the same is used by all agents.
import Mathlib import Definitions.Def_TailRiskSharing_RobustVaR_Setting import Definitions.Def_TailRiskSharing_RobustVaR_Wasserstein
namespace TailRiskSharing.RobustVaR
open MeasureTheory
theorem theorem6_robust_var_comonotonic {Ω : Type*} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P] (hP : TailRiskSharing.VaRConv.IsAtomless P)
(X : Ω → ℝ) (hX : X ∈ TailRiskSharing.TailConv.Linf P) (Λ : TailRiskSharing.VaRConv.Side) (m : ℕ) :
(∀ (δs : Fin (m + 1) → ℝ) (α : ℝ), 0 < δs 0 → Monotone δs → 0 < α → α < 1 →
TailRiskSharing.ComonoConv.comonoInfConv P (TailRiskSharing.TailConv.Linf P) (fun i => robust P 1 (δs i) (TailRiskSharing.VaRConv.VaRS P Λ α)) X =
((robust P 1 (δs 0) (TailRiskSharing.VaRConv.VaRS P Λ α) X + ∑ i : Fin m, δs i.succ / α : ℝ) : EReal) ∧
IsOptimalComonoAllocation P (TailRiskSharing.TailConv.Linf P) (fun i => robust P 1 (δs i) (TailRiskSharing.VaRConv.VaRS P Λ α)) X
(fun i => if i = 0 then X else 0)) ∧
(∀ (αs : Fin (m + 1) → ℝ) (δ : ℝ), Antitone αs → αs 0 < 1 → 0 < αs (Fin.last m) → 0 < δ →
TailRiskSharing.ComonoConv.comonoInfConv P (TailRiskSharing.TailConv.Linf P) (fun i => robust P 1 δ (TailRiskSharing.VaRConv.VaRS P Λ (αs i))) X =
((robust P 1 δ (TailRiskSharing.VaRConv.VaRS P Λ (αs 0)) X + ∑ i : Fin m, δ / αs i.succ : ℝ) : EReal) ∧
IsOptimalComonoAllocation P (TailRiskSharing.TailConv.Linf P) (fun i => robust P 1 δ (TailRiskSharing.VaRConv.VaRS P Λ (αs i))) X
(fun i => if i = 0 then X else 0)) := by sorry
end TailRiskSharing.RobustVaR
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.