Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2201.12898 v4 pith:FWRR2PZG submitted 2022-01-30 math.OC cs.CEcs.SYeess.SYq-fin.MFq-fin.RM

Clearing Payments in Dynamic Financial Networks

classification math.OC cs.CEcs.SYeess.SYq-fin.MFq-fin.RM
keywords paymentsclearingfinancialmodelcasedynamicfullliabilities
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper proposes a novel dynamical model for determining clearing payments in financial networks. We extend the classical Eisenberg-Noe model of financial contagion to multiple time periods, allowing financial operations to continue after possible initial pseudo defaults, thus permitting nodes to recover and eventually fulfil their liabilities. Optimal clearing payments in our model are computed by solving a suitable linear program, both in the full matrix payments case and in the pro-rata constrained case. We prove that the proposed model obeys the \emph{priority of debt claims} requirement, that is, each node at every step either pays its liabilities in full, or it pays out all its balance. In the pro-rata case, the optimal dynamic clearing payments are unique, and can be determined via a time-decoupled sequential optimization approach.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.