Pith. sign in

REVIEW 1 cited by

Computational aspects of robust optimized certainty equivalents and option pricing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1706.10186 v3 pith:BV67QXCO submitted 2017-06-30 q-fin.RM math.OC

classification q-fin.RMmath.OC
keywords riskrobustmeasurepricingaveragecasecertaintydimensional
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Accounting for model uncertainty in risk management and option pricing leads to infinite dimensional optimization problems which are both analytically and numerically intractable. In this article we study when this hurdle can be overcome for the so-called optimized certainty equivalent risk measure (OCE) -- including the average value-at-risk as a special case. First we focus on the case where the uncertainty is modeled by a nonlinear expectation penalizing distributions that are "far" in terms of optimal-transport distance (Wasserstein distance for instance) from a given baseline distribution. It turns out that the computation of the robust OCE reduces to a finite dimensional problem, which in some cases can even be solved explicitly. This principle also applies to the shortfall risk measure as well as for the pricing of European options. Further, we derive convex dual representations of the robust OCE for measurable claims without any assumptions on the set of distributions. Finally, we give conditions on the latter set under which the robust average value-at-risk is a tail risk measure.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Robust SGLD algorithm for solving non-convex distributionally robust optimisation problems

    math.OC 2024-03 unverdicted novelty 5.0 of 10

    Develops robust SGLD with non-asymptotic convergence bounds for non-convex DRO and applies it to neural network regression under adversarial corruption.

Pith tools