2.1 Measures of systemic risk
Let \((\Omega , \mathfrak{F}, \mathbb{P})\) be an atomless probability space, and for some integer \(d\ge 1\), let \(\mathcal{Y}^{d} \subseteq L^{0}( \Omega ;\mathbb{R}^{d})\) be a collection of \(d\)-dimensional random vectors which is closed under translation, meaning that \(Y\in \mathcal{Y}^{d}\) and \(k\in \mathbb{R}^{d}\) implies that \(Y+k\in \mathcal{Y}^{d}\). From a risk management perspective, the random vector \(Y = (Y_{1}, \ldots , Y_{d})^{\top }\in \mathcal{Y}^{d}\) represents the respective gains and losses of a system of \(d\) financial firms. That is, positive values of the component \(Y_{i}\) represent gains of firm \(i\) and negative values correspond to losses. Let \(\mathcal{M}^{d}\) be the class of probability distributions of elements of \(\mathcal{Y}^{d}\). Let \(\Lambda \colon \mathbb{R}^{d}\to \mathbb{R}\) be a measurable aggregation function, meaning that it is non-constant and increasing with respect to the componentwise order. An aggregation function is typically, but not necessarily, assumed to be continuous or even concave. Let \(\mathcal{Y}\subseteq L^{0}(\Omega ;\mathbb{R})\) be a collection of random variables which is closed under translation and contains \(\{\Lambda (Y)\colon Y\in \mathcal{Y}^{d}\}\). Similarly to \(\mathcal{M}^{d}\), let ℳ be the class of probability distributions of elements of \(\mathcal{Y}\).
We consider a scalar monetary law-invariant risk measure
\(\rho \colon \mathcal{Y}\cup \mathbb{R}\to \mathbb{R}^{*}\); see Artzner et al. [
6]. That is, for all
\(X,Z\in \mathcal{Y}\cup \mathbb{R}\) and
\(m\in \mathbb{R}\), it holds that
\({\rho (X+m) = \rho (X) - m}\) (cash-invariance) and
\(\rho (X)\le \rho (Z)\) if
\(X\ge Z\) ℙ-a.s. (monotonicity). Moreover, we assume that
\(\rho (0)\in \mathbb{R}\) so that cash-invariance induces a unique mapping
\(\rho \colon \mathbb{R}\to \mathbb{R}\). Exploiting law-invariance, we identify
\(\rho \colon \mathcal{Y}\cup \mathbb{R}\to \mathbb{R}^{*}\) with its induced risk functional
\(\hat{\rho }\colon \mathcal{M}\cup \{\delta _{x}:x\in \mathbb{R}\}\to \mathbb{R}^{*}\), where
\(\hat{\rho }(F) = \rho (X)\) for some
\(X\sim F\), and simply write
\(\rho \) in both cases.
We present the two most natural law-invariant set-valued measures of systemic risk that are based on
\(\rho \) and
\(\Lambda \), namely
(2.1)
(2.2)
In (
2.2) and later, we use the shorthand
\(\bar{k} := \sum _{i=1}^{d} k_{i}\) for
\(k = (k_{1}, \ldots , k_{d})^{\top }\in \mathbb{R}^{d}\). Note the difference between
\(R\) and
\(R^{\text{ins}}\). The risk measure
\(R\) takes an ex ante perspective in the sense that it specifies all capital allocations
\(k\in \mathbb{R}^{d}\) needed to be added to the system
\(Y\) to make the aggregated system
\(\Lambda (Y+k)\) acceptable under
\(\rho \). On the other hand,
\(R^{\text{ins}}\) takes an ex post perspective on quantifying the risk of the system
\(Y\): It first considers the current aggregated system
\(\Lambda (Y)\) and then specifies the
total capital requirement
\(\bar{k}\) one needs to add to make the aggregated system acceptable, which amounts to specifying the
bail-out costs of the aggregated system
\(\Lambda (Y)\) under
\(\rho \). In particular, the risk measure
\(R^{\text{ins}}\) is
insensitive to the capital allocation to each financial firm, disregarding possible transaction costs or other dependence structures between the financial firms and ignoring how the addition of capital changes the system itself. This justifies the mnemonic terminology. Both risk measures
\(R\) and
\(R^{\text{ins}}\) can be of interest in applications, taking into regard the different perspectives on systemic risk. However, the mathematical treatment and complexity differ considerably: Due to the cash-invariance of
\(\rho \),
\(R^{\text{ins}}\) takes the equivalent form
\(R^{\text{ins}}(Y) = \{k\in \mathbb{R}^{d}\colon \rho (\Lambda (Y)) \le \bar{k}\} \). This means that
\(R^{\text{ins}}\) is actually a bijection of the scalar risk measure
\(\rho \circ \Lambda \colon \mathcal{Y}^{d}\to \mathbb{R}^{*}\) considered in Chen et al. [
13]. Therefore, one has to evaluate the risk measure
\(\rho \) only once to determine
\(R^{\text{ins}}\). In contrast, such an appealing equivalent formulation is generally not available for
\(R\) unless
\(\Lambda \) is additive, or is even the sum in which case
\(R\) and
\(R^{\text{ins}}\) coincide. Consequently, in general, one is bound to evaluate
\(\rho \) infinitely often to compute
\(R\); see also the discussion in Feinstein et al. [
23]. The main focus of this paper are elicitability and identifiability results for systemic risk measures of the form (
2.1) and (
2.2). However, since one can exploit the one-to-one relation between
\(R^{\text{ins}}\) and
\(\rho \circ \Lambda \) and make use of the revelation principle, see Fissler [
24, Sect. 2.3], Gneiting [
35] and Osband [
55, Sect. 2.1], to establish (exhaustive) elicitability and identifiability results, we do not present results about
\(R^{\text{ins}}\) in this paper, but rather defer them to Fissler et al. [
26, Supplementary Material].
For the sake of completeness, we recall the most important properties of
\(R\) presented in Feinstein et al. [
23]. Because
\(\rho \) is cash-invariant and
\(\Lambda \) is increasing, the values of both
\(R\) and
\(R^{\text{ins}}\) defined in (
2.1) and (
2.2) are
upper sets, i.e.,
\({R(Y) = R(Y) +\mathbb{R}_{+}^{d}} \) for any
\(Y\in \mathcal{Y}^{d}\), where
\(\mathbb{R}_{+}^{d}\) denotes the collection of vectors in
\(\mathbb{R}^{d}\) with only nonnegative elements and for any two sets
\(A, B\subseteq \mathbb{R}^{d}\),
\(A+B:= \{a+b\colon a\in A, \ b\in B\}\) is the usual
Minkowski sum. Recall that we have
\(A+\emptyset = \emptyset + A = \emptyset \). Following the notation of [
23], we denote the collection of upper sets in
\(\mathbb{R}^{d}\) with ordering cone
\(\mathbb{R}_{+}^{d}\) by
\(\mathcal{P}(\mathbb{R}^{d}; \mathbb{R}^{d}_{+}) := \{B\subseteq \mathbb{R}^{d}\colon B = B+\mathbb{R}^{d}_{+}\}\). Both
\(\mathbb{R}^{d}\) and
\(\emptyset \) are elements of
\(\mathcal{P}(\mathbb{R}^{d}; \mathbb{R}^{d}_{+}) \). Moreover,
\(R\) defined in (
2.1) can attain these values even if the underlying scalar risk measure
\(\rho \) maps to ℝ only, e.g. when
\(\Lambda \) is bounded. While
\(R(Y) = \emptyset \) corresponds to the case that a scalar risk measure of the financial position
\(Y\) is
\(+\infty \), meaning that the system
\(Y\) is deemed risky no matter how much capital is injected, the case
\(R(Y) = \mathbb{R}^{d}\) corresponds to
\(-\infty \) in the scalar case. The latter situation of “cash cows” with the possibility to withdraw any finite amount of money without rendering the position risky is usually deemed unrealistic and is excluded. Therefore, we usually only discuss the case
\(R(Y)=\emptyset \), but remark that a treatment of the case
\(R(Y)=\mathbb{R}^{d}\) would also be possible for most results. Monotonicity and cash-invariance carry over to
\(R\) in that
\(R(Y)\supseteq R(Z)\) for all
\(Y,Z\in \mathcal{Y}^{d}\) with
\(Y\ge Z\) ℙ-a.s. componentwise, and
\(R(Y+k) = R(Y) - k\) for all
\(k\in \mathbb{R}^{d}\). Monotonicity also carries over to
\(R^{\text{ins}}\); note, however, that
\(R^{\text{ins}}\) is in general not cash-invariant. We introduce further subclasses of
\(\mathcal{P}(\mathbb{R}^{d}; \mathbb{R}^{d}_{+})\), where
\(\mathcal{B}(\mathbb{R}^{d})\) denotes the Borel-
\(\sigma \)-algebra on
\(\mathbb{R}^{d}\).
For any set
\(A\subseteq \mathbb{R}^{d}\), we denote its topological boundary by
\(\partial A\). We introduce the law-invariant map
$$\begin{aligned} &R_{0}\colon \mathcal{Y}^{d}\to 2^{\mathbb{R}^{d}}, \qquad Y \mapsto R_{0}(Y) = \big\{ k\in \mathbb{R}^{d}\colon \rho \big(\Lambda (Y+k)\big)=0 \big\} . \end{aligned}$$
(2.3)
Occasionally and when explicitly stated, we impose one of the following assumptions.
A sufficient condition for
\(R(Y)\in \mathcal{F}(\mathbb{R}^{d};\mathbb{R}^{d}_{+})\) is that for any convergent sequence
\((k_{n})_{n\in \mathbb{N}}\subseteq \mathbb{R}^{d}\) with limit
\(k\), we have
$$ \rho \big(\Lambda (Y+k)\big)\le \liminf _{n\to \infty } \rho \big( \Lambda (Y+k_{n})\big). $$
(2.4)
The inequality in (
2.4) holds e.g. if
\(\Lambda \) is continuous and if
\(\rho (X)\le \liminf _{n\to \infty } \rho (X_{n})\) for all sequences
\((X_{n})\) in
\(\mathcal{Y}\) converging almost surely to
\(X\in \mathcal{Y}\). In particular, if
\(\mathcal{Y}= L^{\infty }(\Omega ;\mathbb{R})\),
\(\rho \) is convex,
\(\Lambda \) continuous, and either (a)
\(\Lambda \) is bounded (invoking the law-invariance of
\(\rho \) and the results from Jouini et al. [
44] and Svindland [
60]) or (b)
\(\Lambda \) is uniformly continuous, then (
2.4) holds. For instance in the network model considered in Sect.
5.1,
\(\Lambda \) is bounded. Otherwise in the literature,
\(\Lambda \) is often a concave function and thus not bounded (unless it is constant). Hence, for concave
\(\Lambda \), one could check whether it is uniformly continuous. This is clearly the case for instance for the most straightforward choice—the sum—as well as for instance for the aggregation function suggested by Amini et al. [
4], also considered in Sect.
5.1. Moreover, note that we provide sufficient conditions only and not necessary ones, so that one may also check
\(R(Y)\in \mathcal{F}(\mathbb{R}^{d};\mathbb{R}^{d}_{+})\) on a case-by-case basis.
If
\(\emptyset \neq R(Y) \in \mathcal{F}(\mathbb{R}^{d};\mathbb{R})\), then
\(R_{0}(Y)\neq \emptyset \). Since
\(\Lambda \) is increasing and
\(\rho \) is cash-invariant, one obtains
\(R(Y) = R_{0}(Y) + \mathbb{R}_{+}^{d} \). Hence the values of
\(R_{0}\) determine
\(R\) completely. Moreover, if
\(\Lambda \) is strictly increasing, we have
\(R_{0}(Y) = \partial R(Y)\), meaning that
\(R_{0}(Y)\) contains the
efficient capital allocations that make
\(Y\) acceptable under
\(R\). Therefore, under Assumption
2.3,
\(R\) and
\(R_{0}\) are connected via a one-to-one relation. Again invoking the revelation principle [
35, Theorem 4], this means that exhaustive elicitability results for
\(R\) (Theorem
3.10 (iii)) carry over to
\(R_{0}\). In a nutshell, the
revelation principle asserts that if there is a bijection, say
\(g\), such that
\(R_{0} = g(R)\), then
\(R_{0}\) is (exhaustively) elicitable if and only if
\(R\) is elicitable. Moreover,
\(S(A,y)\) is strictly consistent for
\(R\) if and only if
\(S(g^{-1}(A),y)\) is strictly consistent for
\(R_{0}\).
Finally, we recall the definition of an important scalarisation of the systemic risk measure
\(R\), called
efficient cash-invariant allocation rule (EAR), as introduced in Feinstein et al. [
23]. Roughly speaking, for
\(Y\in \mathcal{Y}^{d}\),
\(\text{{EAR}}(Y)\) specifies the capital allocations with minimal weighted cost among allocations in
\(R(Y)\). For simplicity, we confine our attention to the situation when
\(R(Y)\) is closed and to EARs with a
fixed price or weight vector
\(w\in \mathbb{R}^{d}_{++}:= \{x\in \mathbb{R}^{d}\colon x_{1}, \ldots , x_{d}>0\}\).
For \(Y\in \mathcal{Y}^{d}\), if there is a supporting hyperplane of \(R(Y)\) orthogonal to \(w\), then \(\text{{EAR}}_{w}(Y)\) is the intersection of \(\partial R(Y)\) and this hyperplane. Hence \(\text{{EAR}}_{w}(Y)\) is not necessarily a singleton. If there is no supporting hyperplane of \(R(Y)\) orthogonal to \(w\), the function \(R(Y)\ni k \mapsto w^{\top }k\) is unbounded from below and we set \(\text{{EAR}}_{w}(Y)=\emptyset \).
Since \(\rho \) is law-invariant, so are the derived quantities \(R\), \(R^{\text{ins}}\), \(R_{0}\) and \(\text{{EAR}}_{w}\). Therefore, in analogy to our treatment of \(\rho \), we identify \(R\) with the risk functional \(\hat{R}\), where \(\hat{R}(F) = R(Y)\) for \(Y\sim F\in \mathcal{M}^{d}\), and simply write \(R\) for either; we use analogous conventions for \(R_{0}\) and \(\text{{EAR}}_{w}\).
2.2 Elicitability and identifiability of set-valued functionals
We have already mentioned the definitions of elicitability and identifiability for scalar risk measures
\(\rho \colon \mathcal{M}\to \mathbb{R}^{*}\) in (
1.2) and (
1.3), where we slightly extend the common definitions to account for
\(\rho \) possibly attaining
\(\infty \). All other risk measures considered here,
\(R\),
\(R_{0}\) and
\(\text{{EAR}}\), are set-valued, attaining subsets of
\(\mathbb{R}^{d}\). Hence we make use of the theoretical framework on forecast evaluation of set-valued functionals introduced in Fissler et al. [
25]. The main idea is to have a thorough distinction concerning the form of the forecasts between a
selective notion where forecasts are single points, and an
exhaustive mode where forecasts are set-valued. Moreover, corresponding notions of identifiability and elicitability are introduced and discussed in a very general setting, with the main result being that—subject to mild conditions—a set-valued functional is elicitable either in the selective, or the exhaustive sense, or not elicitable at all [
25, Theorem 2.14]. We confine ourselves to introducing only the notions we discuss in this paper and do so directly in terms of
\(R\) and
\(R_{0}\); the case of
\(\text{{EAR}}\)s is considered separately later. In the sequel, let
\(\mathcal{A}\subseteq 2^{\mathbb{R}^{d}}\). Moreover, for scoring functions
\(S\colon \mathcal{A}\times \mathbb{R}^{d}\to \mathbb{R}^{*}\) or identification functions
\(V\colon \mathbb{R}^{d}\times \mathbb{R}^{d}\to \mathbb{R}\), we use the shorthands
\(\bar{S}(A,F) := \int S(A,y)\,\mathrm{d}F(y)\) and
\(\bar{V}(x,F) := \int V(x,y)\,\mathrm{d}F(y)\) for
\(A\in \mathcal{A}\),
\(x\in \mathbb{R}^{d}\), and tacitly assume that these integrals exist for all
\(F\in \mathcal{M}^{d}\), where we say that the integral
\(\int g(y)\,\mathrm{d}F(y)\) of a function
\(g \colon \mathbb{R}\to [-\infty , \infty ]\) exists if
\(g\) is measurable and
\(\int g(y)^{+}\,\mathrm{d}F(y)<\infty \) or
\(\int g(y)^{-}\,\mathrm{d}F(y)<\infty \). In that case, we set
$$ \int g(y)\,\mathrm{d}F(y) := \int g(y)^{+}\,\mathrm{d}F(y) - \int g(y)^{-} \,\mathrm{d}F(y) \in [-\infty , \infty ]. $$
Note that the strict consistency of an exhaustive scoring function \(S\) for \(R\) implies that \(\bar{S}(R(F),F) \in \mathbb{R}\) for all \(F\in \mathcal{M}^{d}\).