Search Results (2)

The increasingly complex economic and financial environment in which we live makes the management of liquidity in payment systems and the economy in general a persistent challenge. New technologies make it possible to address this challenge through alternative solutions that complement and strengthen existing payment systems. For example, interbank balancing and clearing methods (such as real-time gross settlement) can also be applied to private payments, complementary currencies, and trade credit clearing to provide better liquidity and risk management. The paper defines the concept of a balanced payment system mathematically and demonstrates the effects of balancing on a few small examples. It then derives the construction of a balanced payment subsystem that can be settled in full and therefore that can be removed in toto to achieve debt reduction and payment gridlock resolution. Using well-known results from graph theory, the main output of the paper is the proof—for the general formulation of a payment system with an arbitrary number of liquidity sources—that the amount of liquidity saved is maximum, along with a detailed discussion of the practical steps that a lending institution can take to provide different levels of service subject to the constraints of available liquidity and its own cap on total overdraft exposure. From an applied mathematics point of view, the original contribution of the paper is two-fold: (1) the introduction of a liquidity node with a store of value function in obligation-clearing; and (2) the demonstration that the case with one or more liquidity sources can be solved with the same mathematical machinery that is used for obligation-clearing without liquidity. The clearing and balancing methods presented are based on the experience of a specific application (Tetris Core Technologies), whose wider adoption in the trade credit market could contribute to the financial stability of the whole economy and a better management of liquidity and risk overall. Full article

In this paper, we study the Parisian time of a reflected Brownian motion with drift on a finite collection of rays. We derive the Laplace transform of the Parisian time using a recursive method, and provide an exact simulation algorithm to sample from the distribution of the Parisian time. The paper was motivated by the settlement delay in the real-time gross settlement (RTGS) system. Both the central bank and the participating banks in the system are concerned about the liquidity risk, and are interested in the first time that the duration of settlement delay exceeds a predefined limit. We reduce this problem to the calculation of the Parisian time. The Parisian time is also crucial in the pricing of Parisian type options; to this end, we will compare our results to the existing literature. Full article