Finding Clearing Payments in Financial Networks with Credit Default Swaps is PPAD-complete

We consider the problem of clearing a system of interconnected banks that have been exposed to a shock on their assets. Eisenberg and Noe (2001) showed that when banks can only enter into simple debt contracts with each other, then a clearing vector of payments can be computed in polynomial time. In this paper, we show that the situation changes radically when banks can also enter into credit default swaps (CDSs), i.e., financial derivative contracts that depend on the default of another bank. We prove that computing an approximate solution to the clearing problem with sufficiently small constant error is PPAD-complete. To do this, we demonstrate how financial networks with debt and CDSs can encode arithmetic operations such as addition and multiplication. Our results have practical impact for network stress tests and reveal computational complexity as a new concern regarding the stability of the financial system.

[1]  Christos H. Papadimitriou,et al.  On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence , 1994, J. Comput. Syst. Sci..

[2]  Sanjeev Khanna,et al.  Sensitivity and Computational Complexity in Financial Networks , 2015, Algorithmic Finance.

[3]  Franklin Allen,et al.  Financial Contagion , 2000, Journal of Political Economy.

[4]  J. Leon Zhao,et al.  Network-Based Modeling and Analysis of Systemic Risk in Banking Systems , 2012, MIS Q..

[5]  A. Tahbaz-Salehi,et al.  Systemic Risk and Stability in Financial Networks , 2013 .

[6]  David Zuckerman,et al.  Pseudorandom financial derivatives , 2010, EC '11.

[7]  Larry Eisenberg,et al.  Systemic Risk in Financial Networks , 1999, Manag. Sci..

[8]  G. Caldarelli,et al.  DebtRank: Too Central to Fail? Financial Networks, the FED and Systemic Risk , 2012, Scientific Reports.

[9]  M. Elliott,et al.  Financial Networks and Contagion , 2014 .

[10]  M. Scheffer,et al.  Complexity theory and financial regulation , 2016, Science.

[11]  Sven Seuken,et al.  Clearing Payments in Financial Networks with Credit Default Swaps [Extended Abstract] , 2016, EC.

[12]  Xi Chen,et al.  Computing Nash Equilibria: Approximation and Smoothed Complexity , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[13]  Mark Braverman,et al.  The computational hardness of pricing compound options , 2014, ITCS.

[14]  Aviad Rubinstein,et al.  Inapproximability of Nash Equilibrium , 2014, STOC.

[15]  Sanjeev Arora,et al.  Computational complexity and information asymmetry in financial products , 2011, Commun. ACM.

[16]  L. C. G. Rogers,et al.  Failure and Rescue in an Interbank Network , 2011, Manag. Sci..

[17]  Constantinos Daskalakis,et al.  On the complexity of approximating a Nash equilibrium , 2011, SODA '11.

[18]  Paul W. Goldberg,et al.  The complexity of computing a Nash equilibrium , 2006, STOC '06.