Netting and Resolving Debt with Graphs
Modelling a financial system’s debts as a directed graph and simplifying them. Netting through a clearing party, a trust-constrained reduction algorithm, the fixed-cost variant as Subset Sum, and dependent debt as Minimum Cost Feedback Arc Set, with an NP-hardness reduction from Vertex Cover.