Dynamic Debt Swapping in Financial Networks

TL;DR

This paper investigates the algorithmic complexity of debt swaps in financial networks, analyzing their potential to improve stability and utility, and providing complexity results for various optimization and reachability problems.

Contribution

It offers a comprehensive complexity analysis of debt swapping operations, including polynomial algorithms and hardness results for different optimization scenarios.

Findings

Semi-positive v-improving swaps have polynomial-length sequences.

Reaching a stable network configuration with arbitrary swaps is PLS-complete.

Maximizing a bank's utility via swaps is NP-hard to approximate.

Abstract

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 represent debt contracts. They can improve the clearing payments and the stability of these networks. However, their algorithmic properties are not well-understood. We analyze the computational complexity of debt swapping. Our main interest lies in semi-positive swaps, in which no creditor strictly suffers and at least one strictly profits. These swaps lead to a Pareto-improvement in the entire network. We consider network optimization via sequences of v-improving debt swaps from which a given bank v strictly profits. For ranking-based clearing, we show that every sequence of semi-positive v-improving swaps has polynomial length. In contrast, for arbitrary v-improving swaps, the problem of reaching a network configuration that allows no further swaps is PLS-complete. In global optimization, the goal is to maximize the utility of a given bank $v$ by performing a sequence of debt swaps in the network. This problem is NP-hard to approximate for multiple types of swaps. Moreover, we study reachability problems -- deciding if a sequence of swaps exists between given initial and final networks. We design a polynomial-time algorithm to decide this question for arbitrary swaps and derive hardness results for several other types of swaps. Many of our results can be extended to networks with arbitrary monotone clearing.