Researchers' new algorithm computes minimal financial clearing states in polynomial time
The algorithm solves a long-standing complexity problem in the Eisenberg-Noe financial network model.
Deep Dive
Researchers Leander Besting, Martin Hoefer, and Lars Huth developed a new algorithm for computing Tarski fixed points in financial networks. Their work provides the first strongly polynomial-time algorithm to compute minimal clearing states in generalized Eisenberg-Noe models with monotone, piecewise-linear payment functions and default costs. This enables financial institutions to efficiently determine worst-case asset availability during defaults and analyze the impact of claims trading for systemic risk management.
Why It Matters
Enables faster, more accurate systemic risk assessment for banks and regulators during financial crises.