Sensitivity and Computational Complexity in Financial Networks
Brett Hemenway, Sanjeev Khanna

TL;DR
This paper analyzes the sensitivity and computational complexity of financial networks, revealing fundamental barriers to understanding systemic risks due to high sensitivity and intractability of failure estimation.
Contribution
It demonstrates that small changes in investments can drastically affect system stability and that estimating failures is computationally hard even with complete information.
Findings
Small self-holdings lead to high sensitivity in valuations.
Estimating the number of failures is computationally intractable.
Uncertainty in cross-holdings amplifies systemic risk.
Abstract
Modern financial networks exhibit a high degree of interconnectedness and determining the causes of instability and contagion in financial networks is necessary to inform policy and avoid future financial collapse. In the American Economic Review, Elliott, Golub and Jackson proposed a simple model for capturing the dynamics of complex financial networks. In Elliott, Golub and Jackson's model, each institution in the network can buy underlying assets or percentage shares in other institutions (cross-holdings) and if any institution's value drops below a critical threshold value, its value suffers an additional failure cost. This work shows that even in simple model put forward by Elliott, Golub and Jackson there are fundamental barriers to understanding the risks that are inherent in a network. First, if institutions are not required to maintain a minimum amount of self-holdings, an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
