Settlement Fund Circulation Problem

Authors Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Thumbnail PDF


  • Filesize: 0.55 MB
  • 13 pages

Document Identifiers

Author Details

Hitoshi Hayakawa
Toshimasa Ishii
Hirotaka Ono
Yushi Uno

Cite AsGet BibTex

Hitoshi Hayakawa, Toshimasa Ishii, Hirotaka Ono, and Yushi Uno. Settlement Fund Circulation Problem. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 46:1-46:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


In the economic activities, the central bank has an important role to cover payments of banks, when they are short of funds to clear their debts. For this purpose, the central bank timely puts funds so that the economic activities go smooth. Since payments in this mechanism are processed sequentially, the total amount of funds put by the central bank critically depends on the order of the payments. Then an interest goes to the amount to prepare if the order of the payments can be controlled by the central bank, or if it is determined under the worst case scenario. This motivates us to introduce a brand-new problem, which we call the settlement fund circulation problem. The problems are formulated as follows: Let G=(V,A) be a directed multigraph with a vertex set V and an arc set A. Each arc a\in A is endowed debt d(a)\ge 0, and the debts are settled sequentially under a sequence \pi of arcs. Each vertex v\in V is put fund in the amount of p_{\pi}(v)\ge 0 under the sequence. The minimum/maximum settlement fund circulation problem (Min-SFC/Max-SFC) in a given graph G with debts d: A\rightarrow \mathbb{R}_{+}\cup \{0\} asks to find a bijection \pi:A\to \{1,2,\dots,|A|\} that minimizes/maximizes the total funds \sum _{v\in V}p_{\pi }(v). In this paper, we show that both Min-SFC and Max-SFC are NP-hard; in particular, Min-SFC is (I) strongly NP-hard even if G is (i) a multigraph with |V|=2 or (ii) a simple graph with treewidth at most two,and is (II) (not necessarily strongly) NP-hard for simple trees of diameter four, while it is solvable in polynomial time for stars. Also, we identify several polynomial time solvable cases for both problems.
  • Fund settlement
  • Algorithm
  • Digraph
  • Scheduling


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Franklin Allen and Douglas Gale. Financial contagion. Journal of Political Economy, 108(1):1-33, february 2000. Google Scholar
  2. Larry Eisenberg and Thomas H. Noe. Systemic risk in financial systems. Management Science, 47(2):236-249, February 2001. Google Scholar
  3. John Gallant, David Maier, and James Astorer. On finding minimal length superstrings. Journal of Computer and System Sciences, 20(1):50 - 58, 1980. Google Scholar
  4. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman &Co., New York, NY, USA, 1979. Google Scholar
  5. Hitoshi Hayakawa. Theoretical analyses on settlement system: Chapter 1. complexity of payment network (doctoral dissertation). Retrieved from UTokyo Repository (No. A30011), January 2014. Google Scholar
  6. Hitoshi Hayakawa. Characterization of lower bound and upper bound of required settlement fund under real-time gross settlement. Available at SSRN: [Accessed June 1, 2017], February 2016. Google Scholar
  7. Kei Imakubo and Yutka Soejima. The transaction network in japan’s interbank money markets. Monetary and Economic Studies, 28:107-150, November 2010. Google Scholar
  8. Richard M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, 1972. Google Scholar
  9. Jon M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5):604-632, 1999. Google Scholar
  10. François Quesnay. Tableau économique. Versailles, 1758. Google Scholar
  11. Kirsten Bonde Rordam and Morten L. Bech. The topology of danish interbank money flows. Finance Research Unit No. 2009/01, 2009. Google Scholar
  12. Julio J. Rotemberg. Minimal settlement assets in economies with interconnected financial obligations. Journal of Money, Credit, and Banking, 43(1):81-108, February 2011. Google Scholar
  13. Kimmo Soramäki, Morten L. Bech, Jeffrey Arnold, Robert J. Glass, and Walter E. Beyeler. The topology of interbank payment flows. Physica A: Statistical Mechanics and its Applications, 379(1,i1):317-333, June 2007. Google Scholar
  14. World Bank. Global Financial Development Report 2013 : Rethinking the Role of the State in Finance. World Bank, Washington, D.C., 2013. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail