Computational complexity and information asymmetry in financial products

This paper introduces notions from computational complexity into the study of financial derivatives. Traditional economics argues that derivatives, like CDOs and CDSs, ameliorate the negative costs imposed due to asymmetric information between buyers and sellers. This is because securitization via these derivatives allows the informed party to find buyers for the information-insensitive part of the cash flow stream of an asset (e.g., a mortgage) and retain the remainder. In this paper we show that this viewpoint may need to be revised once computational complexity is brought into the picture. Assuming reasonable complexity-theoretic conjectures, we show that derivatives can actually amplify the costs of asymmetric information instead of reducing them. We prove our results both in the worst-case setting, as well as the more realistic average case setting. In the latter case, to argue that our constructions result in derivatives that “look like” real-life derivatives, we use the notion of computational indistinguishability a la cryptography.

[1]  H. L. Hartley,et al.  Manuscript Preparation , 2022 .

[2]  George A. Akerlof The Market for “Lemons”: Quality Uncertainty and the Market Mechanism , 1970 .

[3]  Béla Bollobás,et al.  Random Graphs , 1985 .

[4]  Nathan Linial,et al.  Collective Coin Flipping , 1989, Adv. Comput. Res..

[5]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[6]  H. Simon Bounded Rationality and Organizational Learning , 1991 .

[7]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[8]  Nathan Linial,et al.  The influence of large coalitions , 1993, Comb..

[9]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[10]  Antonio E. Bernardo,et al.  The Valuation of Complex Derivatives by Major Investment Firms: Empirical Evidence , 1997 .

[11]  Irit Dinur,et al.  On the hardness of approximating label-cover , 2004, Inf. Process. Lett..

[12]  D. Duffie,et al.  A liquidity-based model of security design , 1999 .

[13]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[14]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[15]  D. Kahneman Maps of Bounded Rationality: Psychology for Behavioral Economics , 2003 .

[16]  O. Curry Bounded Rationality : The Adaptive Toolbox , 2003 .

[17]  DEPARTMENT OF ECONOMICS , 2003 .

[18]  P. DeMarzo The Pooling and Tranching of Securities: A Model of Informed Intermediation , 2005 .

[19]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[20]  D. Shaffer You've Come A Long Way. .. , 2005 .

[21]  Pierre Flener,et al.  Design of Financial CDO Squared Transactions Using Constraint Programming , 2007, Constraints.

[22]  George A. Akerlof,et al.  The Market for “Lemons”: Quality Uncertainty and the Market Mechanism , 1970 .

[23]  D. Duffie Innovations in Credit Risk Transfer: Implications for Financial Stability , 2008 .

[24]  Markus K. Brunnermeier Deciphering the Liquidity and Credit Crunch 2007-08 , 2008 .

[25]  Markus K. Brunnermeier COMPLEXITY IN FINANCIAL MARKETS , 2008 .

[26]  George S. Oldfield,et al.  The Economics of Structured Finance , 1997 .

[27]  Markus K. Brunnermeier Deciphering the 2007-08 Liquidity and Credit Crunch , 2008 .

[28]  N. Alon,et al.  The Probabilistic Method: Alon/Probabilistic , 2008 .

[29]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[30]  Avi Wigderson,et al.  Public-key cryptography from different assumptions , 2010, STOC '10.

[31]  Aditya Bhaskara,et al.  Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.

[32]  K. Hamidieh Synthetic CDOs modelling, valuation and risk management , 2011 .