An online-decision algorithm for the multi-period bank clearing problem

Abstract

<p style='text-indent:20px;'>The bank clearing problem (BCP) refers to the problem of designing an optimal clearing algorithm for the interbank payment system. Due to the way in which for the payment system has evolved, the classical BCP model is insufficient for addressing this problem accurately. In particular, delayed settlements are allowed in the now popular high-frequency deferred net settlement (DNS) system. In practice, the characteristics of incoming payment instructions are heavily connected to the time of day, and can be predicted with reasonable precision based on historical data. In this paper, we study the multi-period bank clearing problem (MBCP) by introducing the time dimension and considering future instructions in the decision-making process. We design a new clearing algorithm for MBCP using a model predictive control (MPC) policy, which uses historical data to predict payment instructions in the future. We benchmark the designed algorithm's performance with the classical greedy algorithm on the basis of BCP. Given that the liquidity is regular or relatively low, the numerical results indicate that the designed algorithm significantly improves the quality of clearing decision-making and is robust with respect to forecasting errors and fluctuation of future transactions.</p>