Financial networks with singleton liability priorities

DOI10.1016/j.tcs.2023.113965zbMath1527.91175OpenAlexW4378070415MaRDI QIDQ6104351

Bart de Keijzer, Carmine Ventre, Stavros D. Ioannidis

Publication date: 15 June 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113965

zbMATH Keywords

NP-hardnesssystemic riskfinancial networksFIXP

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Financial networks (including contagion, systemic risk, regulation) (91G45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decreasing the nesting depth of expressions involving square roots
• A problem that is easier to solve on the unit-cost algebraic RAM
• The Euclidean traveling salesman problem is NP-complete
• Default ambiguity: finding the best solution to the clearing problem
• The Hairy Ball problem is PPAD-complete
• On the Complexity of Nash Equilibria and Other Fixed Points
• Systemic Risk in Financial Systems
• Sensitivity and computational complexity in financial networks