Skip to main content

Research Repository

Advanced Search

Payment scheduling in the Interval Debt Model

Friedetzky, T.; Kutner, D.; Mertzios, G.B.; Stewart, I.A.; Trehan, A.

Payment scheduling in the Interval Debt Model Thumbnail


D. Kutner


The networks-based study of financial systems has received considerable attention in recent years, but seldom explicitly incorporated the dynamic aspects of such systems. We consider this problem setting from the temporal point of view, and we introduce the Interval Debt Model (IDM) and some scheduling problems based on it, namely: Bankruptcy Minimization / Maximization, in which the aim is to produce a schedule with at most / at least k bankruptcies; Perfect Scheduling, the special case of the minimization variant where k=0; and Bailout Minimization, in which a financial authority must allocate a smallest possible bailout package to enable a perfect schedule. In this paper we investigate the complexity landscape of the various variants of these problems. We show that each of them is NP-complete, in many cases even on very restrictive input instances. On the positive side, we provide for Perfect Scheduling a polynomial-time algorithm on (rooted) out-trees. In wide contrast, we prove that this problem is NP-complete on directed acyclic graphs (DAGs), as well as on instances with a constant number of nodes (and hence also constant treewidth). When the problem definition is relaxed to allow fractional payments, we show by a linear programming argument that Bailout Minimization can be solved in polynomial time.


Friedetzky, T., Kutner, D., Mertzios, G., Stewart, I., & Trehan, A. (2023). Payment scheduling in the Interval Debt Model. .

Conference Name 48th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2023)
Conference Location Novy Smokovec, Slovakia
Start Date Jan 15, 2023
End Date Jan 19, 2023
Acceptance Date Sep 30, 2022
Online Publication Date Jan 1, 2023
Publication Date 2023-01
Deposit Date Oct 19, 2022
Publicly Available Date Oct 20, 2022
Publisher Springer Verlag
Pages 267-282
Series Title Lecture Notes in Computer Science
Series ISSN 0302-9743
ISBN 9783031231001
Public URL


You might also like

Downloadable Citations