In recent years, the amount of payment transactions have exponentially increased and with them, new abstract payment methods and techniques have emerged. In this paper, we provide two new interesting optimization problem solutions aimed to reduce the amount of money needed in a multilateral set-off system. The presented concepts—built upon solutions of relatively new but well-known graph theory and mathematical optimization theory—show how the use of some payment transaction methods can improve the traditional compensation logic behind a payment transaction. These theoretic optimizations solutions can lead to an increase of payment transactions of a specific market area with a common monetary union and system of payments—be it a country, a group of countries, etc—and a specific range of time —be it a year, a month, etc—. Thus, improving, in economic terms, the existing competition, economic activity and welfare.
Citation: Roylan Martinez. Optimization proposals to the payment clearing[J]. Data Science in Finance and Economics, 2023, 3(1): 76-100. doi: 10.3934/DSFE.2023005
In recent years, the amount of payment transactions have exponentially increased and with them, new abstract payment methods and techniques have emerged. In this paper, we provide two new interesting optimization problem solutions aimed to reduce the amount of money needed in a multilateral set-off system. The presented concepts—built upon solutions of relatively new but well-known graph theory and mathematical optimization theory—show how the use of some payment transaction methods can improve the traditional compensation logic behind a payment transaction. These theoretic optimizations solutions can lead to an increase of payment transactions of a specific market area with a common monetary union and system of payments—be it a country, a group of countries, etc—and a specific range of time —be it a year, a month, etc—. Thus, improving, in economic terms, the existing competition, economic activity and welfare.
[1] | Arora S, Barak B (2009) Computational complexity: a modern approach. Cambridge University Press. |
[2] | Calafiore G, Fracastoro G, Proskurnikov AV (2021) Optimal clearing payments in a financial contagion mode. arXiv preprint 2103: 10872. https://doi.org/10.48550/arXiv.2103.10872 doi: 10.48550/arXiv.2103.10872 |
[3] | Chakravorti S (2000) Analysis of systemic risk in multilateral net settlement systems. J Int Financ Mark I 10: 9–30. https://doi.org/10.1016/S1042-4431(99)00022-0 doi: 10.1016/S1042-4431(99)00022-0 |
[4] | Csóka P, Jean-Jacques HP (2018) Decentralized clearing in financial networks. Manage Sci 64: 4681–4699. https://doi.org/10.1287/mnsc.2017.2847 doi: 10.1287/mnsc.2017.2847 |
[5] | Fleischman T, Dini P (2021) Mathematical foundations for balancing the payment system in the trade credit market. J Risk Financ Manage 14: 452. https://doi.org/10.3390/jrfm14090452 doi: 10.3390/jrfm14090452 |
[6] | Ford LR, Fulkerson DR (1956) Maximal flow through a network. Can J Math 8: 399–404. https://doi.org/10.4153/CJM-1956-045-5 doi: 10.4153/CJM-1956-045-5 |
[7] | Guichard D (2017) An introduction to combinatorics and graph theory. Whitman College-Creative Commons. |
[8] | rsampaths16 (2016) Bi-directional (or) Un-directional Edges in Max-Flow. Available from: https://codeforces.com/topic/48253/en1 |
[9] | Simić S, Milanović V (1992) Some remarks on the problem of multilateral compensation. Publikacije Elektrotehničkog fakulteta. Serija Matematika 1992: 27–33. https://www.jstor.org/stable/43666430 |
[10] | West DB (2001) Introduction to graph theory. Upper Saddle River: Prentice hall. |