在金融网络中计算塔斯基固定点
Computing Tarski Fixed Points in Financial Networks
AI总结:
本文提出了一种高效算法,在金融网络中计算最小和最大固定点,并研究了索赔交易以提高清算效率。
摘要:
现代金融网络高度互联,导致相关机构之间出现复杂的相互依赖关系。在著名的埃森伯格-诺模型中,一个基本方面是清算——确定在潜在违约和破产情况下每个金融机构可用资产的数量。清算状态代表一个固定点,满足一组自然公理。存在性可以通过塔斯基定理建立(即使在模型的广泛泛化中也是如此)。虽然最大固定点可以在多项式时间内计算,但计算其他固定点的复杂性仍然是开放性问题。在本文中,我们提供了一个高效的算法来计算最小固定点,该算法在强多项式时间内运行。它适用于埃森伯格-诺模型的广泛泛化,任何单调、分段线性支付函数和违约成本。此外,在这种情况下,我们提供了一个多项式时间算法来计算最大固定点。对于没有违约成本的网络,我们可以在给定范围内高效地决定固定点的存在性。我们还研究了索赔交易,这是对最小清算网络进行局部调整以提高清算的一种方法。我们提供了一个高效的算法来决定帕累托改进交易的存在性,并在存在时计算最优交易。
英文摘要:
Modern financial networks are highly connected and result in complex interdependencies of the involved institutions. In the prominent Eisenberg-Noe model, a fundamental aspect is clearing -- to determine the amount of assets available to each financial institution in the presence of potential defaults and bankruptcy. A clearing state represents a fixed point that satisfies a set of natural axioms. Existence can be established (even in broad generalizations of the model) using Tarski's theorem. While a maximal fixed point can be computed in polynomial time, the complexity of computing other fixed points is open. In this paper, we provide an efficient algorithm to compute a minimal fixed point that runs in strongly polynomial time. It applies in a broad generalization of the Eisenberg-Noe model with any monotone, piecewise-linear payment functions and default costs. Moreover, in this scenario we provide a polynomial-time algorithm to compute a maximal fixed point. For networks without default costs, we can efficiently decide the existence of fixed points in a given range. We also study claims trading, a local network adjustment to improve clearing, when networks are evaluated with minimal clearing. We provide an efficient algorithm to decide existence of Pareto-improving trades and compute optimal ones if they exist.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。