|
This article is cited in 2 scientific papers (total in 2 papers)
On uniqueness of clearing vectors reducing the systemic risk
Kh. El Bitara, Yu. Kabanovabc, R. Mokbela a Laboratoire de Mathématiques, Université de Franche-Comté, 16 Route de Gray, 25030 Besançon, CEDEX, France
b Institute of Informatics Problems, Federal Research Center “Computer Science and Control” of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
c National Research University “MPEI”, 14 Krasnokazarmennaya Str., Moscow, 111250, Russian Federation
Abstract:
Clearing of financial system, i. e., of a network of interconnecting banks, is a procedure of simultaneous repaying debts to reduce their total volume. The vector whose components are repayments of each bank is called clearing vector. In simple models considered by Eisenberg and Noe (2001) and, independently, by Suzuki (2002), it was shown that the clearing to the minimal value of debts accordingly to natural rules can be formulated as fixpoint problems. The existence of their solutions, i. e., of clearing vectors, is rather straightforward and can be obtained by a direct reference to the Knaster–Tarski or Brouwer theorems. The uniqueness of clearing vectors is a more delicate problem which was solved by Eisenberg and Noe using a graph structure of the financial network. The uniqueness results have been proved in two generalizations of the Eisenberg–Noe model: in the Elsinger model with seniority of liabilities and in the Amini–Filipovic–Minca type model with several types of illiquid assets whose firing sale has a market impact.
Keywords:
systemic risk; financial networks; clearing; Knaster–Tarski theorem; Eisenberg–Noe model; debt seniority; price impact.
Received: 25.09.2016
Citation:
Kh. El Bitar, Yu. Kabanov, R. Mokbel, “On uniqueness of clearing vectors reducing the systemic risk”, Inform. Primen., 11:1 (2017), 109–118
Linking options:
https://www.mathnet.ru/eng/ia464 https://www.mathnet.ru/eng/ia/v11/i1/p109
|
Statistics & downloads: |
Abstract page: | 285 | Full-text PDF : | 129 | References: | 41 | First page: | 4 |
|