Multi-Period Liability Clearing via Convex Optimal Control

2020/05/18 by Shane Barratt, Stephen Boyd, Barratt, Shane +1 · 1 citation
Economics, Econometrics and Finance · Mathematics · #Computational Finance (q-fin.CP) #FOS: Economics and business #FOS: Mathematics #Optimization and Control (math.OC) #math.OC #q-fin.CP

paper · pdf · doi:10.48550/arxiv.2005.09066

arxiv created 2020/05/18 · arxiv updated 2020/05/20

Abstract

We consider the problem of determining a sequence of payments among a set of entities that clear (if possible) the liabilities among them. We formulate this as an optimal control problem, which is convex when the objective function is, and therefore readily solved. For this optimal control problem, we give a number of useful and interesting convex costs and constraints that can be combined in any way for different applications. We describe a number of extensions, for example to handle unknown changes in cash and liabilities, to allow bailouts, to find the minimum time to clear the liabilities, or to minimize the number of non-cleared liabilities, when fully clearing the liabilities is impossible.

Cited by

• Clearing in Liability Networks via Sheaves on Directed Hypergraphs

Related

• The value of a liability cash flow in discrete time subject to capital requirements
• Approximations of multi-period liability values by simple formulas
• Optimal Bankruptcy Time and Consumption/Investment Policies on an Infinite Horizon with a Continuous Debt Repayment Until Bankruptcy
• Optimal Clearing Payments in a Financial Contagion Model
• Multiple-prior valuation of cash flows subject to capital requirements