English
Related papers

Related papers: The Computational Complexity of Financial Networks…

200 papers

Financial networks raise a significant computational challenge in identifying insolvent firms and evaluating their exposure to systemic risk. This task, known as the clearing problem, is computationally tractable when dealing with simple…

Computational Complexity · Computer Science 2023-12-14 Stavros D. Ioannidis , Bart de Keijzer , Carmine Ventre

We study computational problems in financial networks of banks connected by debt contracts and credit default swaps (CDSs). A main problem is to determine \emph{clearing} payments, for instance right after some banks have been exposed to a…

Computer Science and Game Theory · Computer Science 2024-09-30 Simon Dohn , Kristoffer Arnsfelt Hansen , Asger Klinkby

Financial networks model a set of financial institutions (firms) interconnected by obligations. Recent work has introduced to this model a class of obligations called credit default swaps, a certain kind of financial derivatives. The main…

Computational Complexity · Computer Science 2022-01-17 Stavros D. Ioannidis , Bart de Keijzer , Carmine Ventre

The importance of adequately modeling credit risk has once again been highlighted in the recent financial crisis. Defaults tend to cluster around times of economic stress due to poor macro-economic conditions, {\em but also} by directly…

Risk Management · Quantitative Finance 2015-06-04 Sebastian Heise , Reimer Kuehn

We study the incentives of banks in a financial network, where the network consists of debt contracts and credit default swaps (CDSs) between banks. One of the most important questions in such a system is the problem of deciding which of…

Risk Management · Quantitative Finance 2020-02-19 Pál András Papp , Roger Wattenhofer

A debt swap is an elementary edge swap in a directed, weighted graph, where two edges with the same weight swap their targets. Debt swaps are a natural and appealing operation in financial networks, in which nodes are banks and edges…

Data Structures and Algorithms · Computer Science 2026-01-30 Henri Froese , Martin Hoefer , Lisa Wilhelmi

We consider financial networks, where banks are connected by contracts such as debts or credit default swaps. We study the clearing problem in these systems: we want to know which banks end up in a default, and what portion of their…

Computational Engineering, Finance, and Science · Computer Science 2020-11-23 Pál András Papp , Roger Wattenhofer

We study financial networks with debt contracts and credit default swaps between specific pairs of banks. Given such a financial system, we want to decide which of the banks are in default, and how much of their liabilities can these…

Computational Engineering, Finance, and Science · Computer Science 2021-10-11 Pál András Papp , Roger Wattenhofer

We analyse time series of CDS spreads for a set of major US and European institutions on a pe- riod overlapping the recent financial crisis. We extend the existing methodology of {\epsilon}-drawdowns to the one of joint {\epsilon}-drawups,…

Risk Management · Quantitative Finance 2015-06-05 Rahul Kaushik , Stefano Battiston

We study insolvency cascades in an interbank system when banks are allowed to insure their loans with credit default swaps (CDS) sold by other banks. We show that, by properly shifting financial exposures from one institution to another, a…

Risk Management · Quantitative Finance 2017-10-16 Matt V. Leduc , Sebastian Poledna , Stefan Thurner

The debts' clearing problem is about clearing all the debts in a group of $n$ entities (e.g. persons, companies) using a minimal number of money transaction operations. In our previous works we studied the problem, gave a dynamic…

Data Structures and Algorithms · Computer Science 2011-11-17 C. Pătcaş

We study financial networks where banks are connected through bilateral liabilities and may default when resources are insufficient to meet obligations. We consider both the standard proportional clearing model and a priority-proportional…

Computer Science and Game Theory · Computer Science 2026-03-31 Gergely Csáji , Rareş-Ioan Mateiu , Alexandru Popa , Ildikó Schlotter

We study financial networks where banks are connected by debt contracts. We consider the operation of debt swapping when two creditor banks decide to exchange an incoming payment obligation, thus leading to a locally different network…

Risk Management · Quantitative Finance 2021-07-13 Pál András Papp , Roger Wattenhofer

In the last years, increasing efforts have been put into the development of effective stress tests to quantify the resilience of financial institutions. Here we propose a stress test methodology for central counterparties based on a network…

The current global financial system forms a highly interconnected network where a default in one of its nodes can propagate to many other nodes, causing a catastrophic avalanche effect. In this paper we consider the problem of reducing the…

Optimization and Control · Mathematics 2022-07-05 Giuseppe Calafiore , Giulia Fracastoro , Anton V. Proskurnikov

Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…

Computational Complexity · Computer Science 2016-11-17 Gabriel Istrate

Financial networks are characterized by complex structures of mutual obligations. These obligations are fulfilled entirely or in part (when defaults occur) via a mechanism called clearing, which determines a set of payments that settle the…

Optimization and Control · Mathematics 2025-10-09 Giuseppe Calafiore , Giulia Fracastoro , Anton V. Proskurnikov

As impressively shown by the financial crisis in 2007/08, contagion effects in financial networks harbor a great threat for the stability of the entire system. Without sufficient capital requirements for banks and other financial…

Risk Management · Quantitative Finance 2019-11-19 Daniel Ritter

The debts' clearing problem is about clearing all the debts in a group of n entities (persons, companies etc.) using a minimal number of money transaction operations. The problem is known to be NP-hard in the strong sense. As for many…

Neural and Evolutionary Computing · Computer Science 2014-02-27 Csaba Patcas , Attila Bartha

Efficient computability is an important property of solution concepts in matching markets. We consider the computational complexity of finding and verifying various solution concepts in trading networks-multi-sided matching markets with…

Computational Complexity · Computer Science 2025-10-03 Tamás Fleiner , Zsuzsanna Jankó , Ildikó Schlotter , Alexander Teytelboym
‹ Prev 1 2 3 10 Next ›