Searcharxiv⌕ Search

arXiv subjects

Birgit Rudloff

Publications and source records attributed to Birgit Rudloff.

At least 37 records · Page 2Linked to original sources

Sensitivity of the Eisenberg-Noe clearing vector to individual interbank liabilities

We quantify the sensitivity of the Eisenberg-Noe clearing vector to estimation errors in the bilateral liabilities of a financial system in a stylized setting. The interbank liabilities matrix is a crucial input to the computation of the clearing vector. However, in practice central bankers and regulators must often estimate this matrix because complete information on bilateral liabilities is rarely available. As a result, the clearing vector may suffer from estimation errors in the liabilities matrix. We quantify the clearing vector's sensitivity to such estimation errors and show that its directional derivatives are, like the clearing vector itself, solutions of fixed point equations. We describe estimation errors utilizing a basis for the space of matrices representing permissible perturbations and derive analytical solutions to the maximal deviations of the Eisenberg-Noe clearing vector. This allows us to compute upper bounds for the worst case perturbations of the clearing vector in our simple setting. Moreover, we quantify the probability of observing clearing vector deviations of a certain magnitude, for uniformly or normally distributed errors in the relative liability matrix. Applying our methodology to a dataset of European banks, we find that perturbations to the relative liabilities can result in economically sizeable differences that could lead to an underestimation of the risk of contagion. Our results are a first step towards allowing regulators to quantify errors in their simulations.

q-fin.MF↗

A Supermartingale Relation for Multivariate Risk Measures

The equivalence between multiportfolio time consistency of a dynamic multivariate risk measure and a supermartingale property is proven. Furthermore, the dual variables under which this set-valued supermartingale is a martingale are characterized as the worst-case dual variables in the dual representation of the risk measure. Examples of multivariate risk measures satisfying the supermartingale property are given. Crucial for obtaining the results are dual representations of scalarizations of set-valued dynamic risk measures, which are of independent interest in the fast growing literature on multivariate risks.

q-fin.RM↗

Set-valued shortfall and divergence risk measures

Risk measures for multivariate financial positions are studied in a utility-based framework. Under a certain incomplete preference relation, shortfall and divergence risk measures are defined as the optimal values of specific set minimization problems. The dual relationship between these two classes of multivariate risk measures is constructed via a recent Lagrange duality for set optimization. In particular, it is shown that a shortfall risk measure can be written as an intersection over a family of divergence risk measures indexed by a scalarization parameter. Examples include set-valued versions of the entropic risk measure and the average value at risk. As a second step, the minimization of these risk measures subject to trading opportunities is studied in a general convex market in discrete time. The optimal value of the minimization problem, called the market risk measure, is also a set-valued risk measure. A dual representation for the market risk measure that decomposes the effects of the original risk measure and the frictions of the market is proved.

q-fin.RM↗

Measures of Systemic Risk

Systemic risk refers to the risk that the financial system is susceptible to failures due to the characteristics of the system itself. The tremendous cost of systemic risk requires the design and implementation of tools for the efficient macroprudential regulation of financial institutions. The current paper proposes a novel approach to measuring systemic risk. Key to our construction is a rigorous derivation of systemic risk measures from the structure of the underlying system and the objectives of a financial regulator. The suggested systemic risk measures express systemic risk in terms of capital endowments of the financial firms. Their definition requires two ingredients: a cash flow or value model that assigns to the capital allocations of the entities in the system a relevant stochastic outcome; and an acceptability criterion, i.e. a set of random outcomes that are acceptable to a regulatory authority. Systemic risk is measured by the set of allocations of additional capital that lead to acceptable outcomes. We explain the conceptual framework and the definition of systemic risk measures, provide an algorithm for their computation, and illustrate their application in numerical case studies. Many systemic risk measures in the literature can be viewed as the minimal amount of capital that is needed to make the system acceptable after aggregating individual risks, hence quantify the costs of a bail-out. In contrast, our approach emphasizes operational systemic risk measures that include both ex post bailout costs as well as ex ante capital requirements and may be used to prevent systemic crises.

q-fin.RM↗

A Parametric Simplex Algorithm for Linear Vector Optimization Problems

In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Loehne [16], that is, it finds a subset of efficient solutions that allows to generate the whole frontier. In that sense, it can also be seen as a generalization of the parametric self-dual simplex algorithm, which originally is designed for solving single objective linear optimization problems, and is modified to solve two objective bounded LVOPs with the positive orthant as the ordering cone in Ruszczynski and Vanderbei [21]. The algorithm proposed here works for any dimension, any solid pointed polyhedral ordering cone C and for bounded as well as unbounded problems. Numerical results are provided to compare the proposed algorithm with an objective space based LVOP algorithm (Benson algorithm in [13]), that also provides a solution in the sense of [16], and with Evans-Steuer algorithm [12]. The results show that for non-degenerate problems the proposed algorithm outperforms Benson algorithm and is on par with Evan-Steuer algorithm. For highly degenerate problems Benson's algorithm [13] excels the simplex-type algorithms; however, the parametric simplex algorithm is for these problems computationally much more efficient than Evans-Steuer algorithm.

math.OC↗

A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle

A method for calculating multi-portfolio time consistent multivariate risk measures in discrete time is presented. Market models for $d$ assets with transaction costs or illiquidity and possible trading constraints are considered on a finite probability space. The set of capital requirements at each time and state is calculated recursively backwards in time along the event tree. We motivate why the proposed procedure can be seen as a set-valued Bellman's principle, that might be of independent interest within the growing field of set optimization. We give conditions under which the backwards calculation of the sets reduces to solving a sequence of linear, respectively convex vector optimization problems. Numerical examples are given and include superhedging under illiquidity, the set-valued entropic risk measure, and the multi-portfolio time consistent version of the relaxed worst case risk measure and of the set-valued average value at risk.

q-fin.RM↗

Convex Hedging in Incomplete Markets

In incomplete financial markets not every contingent claim can be replicated by a self-financing strategy. The risk of the resulting shortfall can be measured by convex risk measures, recently introduced by Föllmer, Schied (2002). The dynamic optimization problem of finding a self-financing strategy that minimizes the convex risk of the shortfall can be split into a static optimization problem and a representation problem. It follows that the optimal strategy consists in superhedging the modified claim $\widetildeφH$, where $H$ is the payoff of the claim and $\widetildeφ$ is the solution of the static optimization problem, the optimal randomized test. In this paper, we will deduce necessary and sufficient optimality conditions for the static problem using convex duality methods. The solution of the static optimization problem turns out to be a randomized test with a typical $0$-$1$-structure.

q-fin.MF↗

On the Dual of the Solvency Cone

A solvency cone is a polyhedral convex cone which is used in Mathematical Finance to model proportional transaction costs. It consists of those portfolios which can be traded into nonnegative positions. In this note, we provide a characterization of its dual cone in terms of extreme directions and discuss some consequences, among them: (i) an algorithm to construct extreme directions of the dual cone when a corresponding "contribution scheme" is given; (ii) estimates for the number of extreme directions; (iii) an explicit representation of the dual cone for special cases. The validation of the algorithm is based on the following easy-to-state but difficult-to-solve result on bipartite graphs: Running over all spanning trees of a bipartite graph, the number of left degree sequences equals the number of right degree sequences.

math.OC↗

A comparison of techniques for dynamic multivariate risk measures

This paper contains an overview of results for dynamic multivariate risk measures. We provide the main results of four different approaches. We will prove under which assumptions results within these approaches coincide, and how properties like primal and dual representation and time consistency in the different approaches compare to each other.

q-fin.RM↗

A Characterization Theorem for Aumann Integrals

A Daniell-Stone type characterization theorem for Aumann integrals of set-valued measurable functions will be proven. It is assumed that the values of these functions are closed convex upper sets, a structure that has been used in some recent developments in set-valued variational analysis and set optimization. It is shown that the Aumann integral of such a function is also a closed convex upper set. The main theorem characterizes the conditions under which a functional that maps from a certain collection of measurable set-valued functions into the set of all closed convex upper sets can be written as the Aumann integral with respect to some $σ$-finite measure. These conditions include the analog of the conlinearity and monotone convergence properties of the classical Daniell-Stone theorem for the Lebesgue integral, and three geometric properties that are peculiar to the set-valued case as they are redundant in the one-dimensional setting.

math.FA↗

Multiportfolio time consistency for set-valued convex and coherent risk measures

Equivalent characterizations of multiportfolio time consistency are deduced for closed convex and coherent set-valued risk measures on $L^p(Ω,\mathcal F, P; R^d)$ with image space in the power set of $L^p(Ω,\mathcal F_t,P;R^d)$. In the convex case, multiportfolio time consistency is equivalent to a cocycle condition on the sum of minimal penalty functions. In the coherent case, multiportfolio time consistency is equivalent to a generalized version of stability of the dual variables. As examples, the set-valued entropic risk measure with constant risk aversion coefficient is shown to satisfy the cocycle condition for its minimal penalty functions, the set of superhedging portfolios in markets with proportional transaction costs is shown to have the stability property and in markets with convex transaction costs is shown to satisfy the composed cocycle condition, and a multiportfolio time consistent version of the set-valued average value at risk, the composed AV@R, is given and its dual representation deduced.

q-fin.RM↗

Set optimization - a rather short introduction

Recent developments in set optimization are surveyed and extended including various set relations as well as fundamental constructions of a convex analysis for set- and vector-valued functions, and duality for set optimization problems. Extensive sections with bibliographical comments summarize the state of the art. Applications to vector optimization and financial risk measures are discussed along with algorithmic approaches to set optimization problems.

math.OC↗

Primal and Dual Approximation Algorithms for Convex Vector Optimization Problems

Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson's outer approximation algorithm, and the second one is a dual variant of it. Both algorithms provide an inner as well as an outer approximation of the (upper and lower) images. Only one scalar convex program has to be solved in each iteration. We allow objective and constraint functions that are not necessarily differentiable, allow solid pointed polyhedral ordering cones, and relate the approximations to an appropriate ε-solution concept. Numerical examples are provided.

math.OC↗

An algorithm for calculating the set of superhedging portfolios in markets with transaction costs

We study the explicit calculation of the set of superhedging portfolios of contingent claims in a discrete-time market model for d assets with proportional transaction costs. The set of superhedging portfolios can be obtained by a recursive construction involving set operations, going backward in the event tree. We reformulate the problem as a sequence of linear vector optimization problems and solve it by adapting known algorithms. The corresponding superhedging strategy can be obtained going forward in the tree. Examples are given involving multiple correlated assets and basket options. Furthermore, we relate existing algorithms for the calculation of the scalar superhedging price to the set-valued algorithm by a recent duality theory for vector optimization problems. The main contribution of the paper is to establish the connection to linear vector optimization, which allows to solve numerically multi-asset superhedging problems under transaction costs.

q-fin.PR↗

Benson type algorithms for linear vector optimization and applications

New versions and extensions of Benson's outer approximation algorithm for solving linear vector optimization problems are presented. Primal and dual variants are provided in which only one scalar linear program has to be solved in each iteration rather than two or three as in previous versions. Extensions are given to problems with arbitrary pointed solid polyhedral ordering cones. Numerical examples are provided, one of them involving a new set-valued risk measure for multivariate positions.

math.OC↗

Set-valued average value at risk and its computation

New versions of the set-valued average value at risk for multivariate risks are introduced by generalizing the well-known certainty equivalent representation to the set-valued case. The first "regulator" version is independent from any market model whereas the second version, called the market extension, takes trading opportunities into account. Essential properties of both versions are proven and an algorithmic approach is provided which admits to compute the values of both version over finite probability spaces. Several examples illustrate various features of the theoretical constructions.

q-fin.RM↗

Time consistency of dynamic risk measures in markets with transaction costs

The paper concerns primal and dual representations as well as time consistency of set-valued dynamic risk measures. Set-valued risk measures appear naturally when markets with transaction costs are considered and capital requirements can be made in a basket of currencies or assets. Time consistency of scalar risk measures can be generalized to set-valued risk measures in different ways. The most intuitive generalization is called time consistency. We will show that the equivalence between a recursive form of the risk measure and time consistency, which is a central result in the scalar case, does not hold in the set-valued framework. Instead, we propose an alternative generalization, which we will call multi-portfolio time consistency and show in the main result of the paper that this property is indeed equivalent to the recursive form as well as to an additive property for the acceptance sets. Multi-portfolio time consistency is a stronger property than time consistency. In the scalar case, both notions coincide.

q-fin.RM↗

Set-valued risk measures for conical market models

Set-valued risk measures on $L^p_d$ with $0 \leq p \leq \infty$ for conical market models are defined, primal and dual representation results are given. The collection of initial endowments which allow to super-hedge a multivariate claim are shown to form the values of a set-valued sublinear (coherent) risk measure. Scalar risk measures with multiple eligible assets also turn out to be a special case within the set-valued framework.

q-fin.RM↗