Approximate clearing in financial networks with credit default swaps: hardness thresholds, a box algorithm, barriers, and exact solvency at bounded degree
cs.CC, q-fin.RM
Submitted: 2026-10-31
Updated: 2026-10-31
Terminology
Sources
- Pure-Circuit: Tight Inapproximability for PPAD
- Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps
- Strong Approximations and Irrationality in Financial Networks with Financial Derivatives
- Clearing Financial Networks with Derivatives: From Intractability to Algorithms
- Public Goods Games in Directed Networks
- The Computational Complexity of Financial Networks with Credit Default Swaps
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?