Pricing, Hedging and Optimally Designing Derivatives Via Minimization of Risk Measures

Pauline Barrieu; Nicole El Karoui

Home/Archive/arXiv

arXiv · 0708.0948

Pricing, Hedging and Optimally Designing Derivatives Via Minimization of Risk Measures

Pauline Barrieu·Nicole El Karoui

View original source ↗Read source document ↗Export metadata ↓

Abstract

The question of pricing and hedging a given contingent claim has a unique solution in a complete market framework. When some incompleteness is introduced, the problem becomes however more difficult. Several approaches have been adopted in the literature to provide a satisfactory answer to this problem, for a particular choice criterion. In this paper, in order to price and hedge a non-tradable contingent claim, we first start with a (standard) utility maximization problem and end up with an equivalent risk measure minimization. This hedging problem can be seen as a particular case of a more general situation of risk transfer between different agents, one of them consisting of the financial market. In order to provide constructive answers to this general optimal risk transfer problem, both static and dynamic approaches are considered. When considering a dynamic framework, our main purpose is to find a trade-off between static and very abstract risk measures as we are more interested in tractability issues and interpretations of the dynamic risk measures we obtain rather than the ultimate general results. Therefore, after introducing a general axiomatic approach to dynamic risk measures, we relate the dynamic version of convex risk measures to BSDEs.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Pauline Barrieu, Nicole El Karoui. 2007-08-07. Pricing, Hedging and Optimally Designing Derivatives Via Minimization of Risk Measures. https://arxiv.org/abs/0708.0948

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rough backward SDEs with discontinuous Young drivers

We study solutions to backward differential equations that are driven hybridly by a deterministic discontinuous rough path $W$ of finite $q$-variation for $q \in [1, 2)$ and by Brownian motion $B$. To distinguish between integration of jumps in a forward- or Marcus-sense, we refer to these equations as forward- respectively Marcus-type rough backward stochastic differential equations (RBSDEs). We establish global well-posedness by proving global apriori bounds for solutions and employing fixed-point arguments locally. Furthermore, we lift the RBSDE solution and the driving rough noise to the space of decorated paths endowed with a Skorokhod-type metric and show stability of solutions with respect to perturbations of the rough noise. Finally, we prove well-posedness for a new class of backward doubly stochastic differential equations (BDSDEs), which are jointly driven by a Brownian martingale $B$ and an independent discontinuous stochastic process $L$ of finite $q$-variation. We explain, how our RBSDEs can be understood as conditional solutions to such BDSDEs, conditioned on the information generated by the path of $L$.

math.PR↗

arXiv2026

Convergence of the KMP model to the KPZ equation

We prove that the Kipnis-Marchioro-Presutti (KMP) process converges to the Kardar-Parisi-Zhang (KPZ) equation, as time $t$ goes to infinity, in a properly scaled observation window shifted by $t^{3/4}$. Our proof is based on identifying the KMP process with a stochastic flow of kernels describing transition probabilities in a certain model of random walk in space-time random environment. This allows to apply a recent result of arXiv:2401.06073 proving convergence of the density field of random walks in random environment to the KPZ equation in a suitably general sense.

math.PR↗

arXiv2026

Permuton and local limits for the Luce model

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities proportional to prescribed positive weights. These permutations arise in applications such as ranking models, the Tsetlin library, and related Markov processes. Under minimal assumptions on the weights, we establish a permuton limit theorem describing the global behavior of Luce-distributed permutations and derive an explicit density of the limiting permuton. We further compute limiting pattern densities and analyze the differences between exact Luce permutations and their permuton approximations. We also study the local convergence of these permutations, proving a quenched Benjamini--Schramm limit and a central limit theorem for consecutive pattern occurrences. Finally, we prove a central limit theorem for the number of inversions.

math.PR↗