The economics and algorithmics of an integral settlement procedure on B2B networks

Massimo Amato, Nazim Fatès, Lucio Gobbi
{"title":"The economics and algorithmics of an integral settlement procedure on B2B networks","authors":"Massimo Amato, Nazim Fatès, Lucio Gobbi","doi":"10.2139/ssrn.3915380","DOIUrl":null,"url":null,"abstract":"We develop the economic and operational foundations of a new method of financing companies’ financial obligations. In this new banking business model, a network funder sets an optimal combination of netting and financing. Given a network of companies and their respective invoices, and under the condition of a full settlement of the invoices, the netting procedure consists in applying a multilateral netting algorithm to the network, conceived as an oriented multi-graph. This algorithm introduces a new method of exploration: during regular periods of time (i.e. monthly, weekly, or even daily sessions), the set of invoices is found that maximises the amount of debt offset, given a quantity of loanable funds. From a systemic point of view, the algorithmic exploration of the multigraph is subject to optimisation constraints. The exploration finds those configurations which allow the network funder to manage a policy trade-off between the maximisation of both the total value of invoices and the number of companies involved in netting, and the minimisation of the amount of financing needed to settle payments in full. To test our method, we use an empirical dataset from Infocert (electronic invoices operator) consisting of more than 60,000 companies. The policy trade-off shows that it is economically significant and feasible for a network funder to reduce the financial need of about 50% of companies by about 45% of the total amount of their financial obligations.","PeriodicalId":139826,"journal":{"name":"SWIFT Institute Research Paper Series","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SWIFT Institute Research Paper Series","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3915380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We develop the economic and operational foundations of a new method of financing companies’ financial obligations. In this new banking business model, a network funder sets an optimal combination of netting and financing. Given a network of companies and their respective invoices, and under the condition of a full settlement of the invoices, the netting procedure consists in applying a multilateral netting algorithm to the network, conceived as an oriented multi-graph. This algorithm introduces a new method of exploration: during regular periods of time (i.e. monthly, weekly, or even daily sessions), the set of invoices is found that maximises the amount of debt offset, given a quantity of loanable funds. From a systemic point of view, the algorithmic exploration of the multigraph is subject to optimisation constraints. The exploration finds those configurations which allow the network funder to manage a policy trade-off between the maximisation of both the total value of invoices and the number of companies involved in netting, and the minimisation of the amount of financing needed to settle payments in full. To test our method, we use an empirical dataset from Infocert (electronic invoices operator) consisting of more than 60,000 companies. The policy trade-off shows that it is economically significant and feasible for a network funder to reduce the financial need of about 50% of companies by about 45% of the total amount of their financial obligations.
B2B网络整体结算程序的经济学和算法
我们开发了一种新的融资公司财务义务方法的经济和操作基础。在这种新的银行业务模式中,网络资助者设定了净额和融资的最佳组合。给定一个公司网络及其各自的发票,并且在发票完全结算的条件下,净额计算程序包括将多边净额计算算法应用于该网络,设想为面向多图。该算法引入了一种新的探索方法:在固定的时间段内(即每月,每周,甚至每天),找到一组发票,使债务抵消的金额最大化,给定一定数量的可贷款资金。从系统的角度来看,多图的算法探索受制于优化约束。探索发现这些配置允许网络资助者在发票总价值和涉及净额的公司数量最大化之间管理政策权衡,以及最小化全额结算所需的融资金额。为了测试我们的方法,我们使用了由6万多家公司组成的Infocert(电子发票运营商)的经验数据集。政策权衡表明,对于网络资助者来说,将约50%的公司的财务需求减少约45%的财务义务总额在经济上是重要和可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信