betaFeedback

WorksComputer Science

Approximate clearing in financial networks with credit default swaps: hardness thresholds, a box algorithm, barriers, and exact solvency at bounded degree

Abstract

We study approximate clearing in financial networks with credit default swaps. For weak notions (W) and (I), we prove PPAD-hardness below a threshold approximately 0.25300.2530 and give a polynomial-time interval algorithm above a threshold approximately 0.28340.2834. On networks whose CDS writers are solvent ex ante, the corresponding bounds are (13−153)/4(13-\sqrt{153})/4 and 3−223-2\sqrt{2}, approximately 0.15770.1577 and 0.17160.1716. The thresholds are sharp for bounded-radius algorithms: for (I) on writer-solvent networks, and for (I) and (W) in general. On non-degenerate networks, (W) and (I) have identical hardness and tractability threshold endpoints. For exact-solvency notion (D), PPAD-hardness holds at every rational error ε<1\varepsilon<1 on non-degenerate networks. On a restricted unit-notional class, let dd be the maximum number of CDS contracts held by a core bank, counted with multiplicity. For rational ε∈[1/2,1)\varepsilon\in[1/2,1), writing ρ=(1+ε)/(1−ε)ρ=(1+\varepsilon)/(1-\varepsilon), the problem is polynomial-time solvable when d<(⌈ρ⌉+1)ρd<(\lceilρ\rceil+1)ρ and PPAD-complete otherwise. At ε=1/3\varepsilon=1/3 the boundary is d=5d=5 versus d=6d=6; below ε=1/9\varepsilon=1/9, degree 22 is already PPAD-complete, while degree 11 is exactly solvable. These degree results concern (D) and do not close the (W)/(I) approximation windows. We also establish a barrier to Pure-Circuit reductions certified by interval propagation under stated interface and auxiliary-bank restrictions. A finite-precision interval algorithm reduces writer-solvent (I) to point selection in near-stalled boxes; selection is polynomial-time when the residual matrix is symmetric or monotone on each strongly connected component. The general and writer-solvent approximation windows remain open.

Introduction

In a financial network, banks owe each other money, and a bank that cannot pay in full pays a fraction of its obligations, its recovery rate. A clearing vector is a vector of recovery rates that is consistent with itself: every bank pays out what it receives, up to its obligations. For networks of ordinary debts, Eisenberg and Noe [6] showed that clearing vectors exist and that the greatest one can be computed in polynomial time. Credit default swaps change this. A CDS obliges its writer to pay the holder an amount that grows as a third bank, the reference, recovers less, so a payment can depend on another bank’s default. Schuldenzucker, Seuken and Battiston [22, 25] showed that such networks can have several clearing vectors, or none once default costs are present, and that finding an approximate clearing vector is PPAD-complete [23]. Ioannidis, de Keijzer and Ventre showed that clearing vectors can be irrational, that exact clearing is FIXP-complete and that its strong approximation is FIXPa\mathrm{FIXP}_{a}-complete [9], and that approximate clearing in the sense of the notion we call (I) is PPAD-hard for small constant errors [10, 11]. Dohn, Hansen and Klinkby [5] introduced an approximation notion with an exact solvency clause and proved PPAD-hardness for every error up to 5−26≈0.1015 - 2\sqrt{6} \approx0.101.

Approximation is measured by a constant error EE: a recovery vector is acceptable if every bank’s recovery is within EE of what the clearing map assigns to it, possibly with further clauses. For E≥1/2E \ge1/2 the weak problems are trivial: the vector with recovery 1/21/2 at every bank that is not solvent ex ante qualifies. The published hardness constants were (2−3)/4≈0.067(2-\sqrt{3})/4 \approx0.067 for (I) [11] and 5−26≈0.1015 - 2\sqrt{6} \approx0.101 for (D) [5] (see § 13), and we are not aware of a polynomial algorithm for general networks at any constant error below 1/21/2 in the literature. Two questions therefore remained: where above these constants the complexity of each notion changes, and whether membership in PPAD survives without the non-degeneracy assumption under which it had been proved; the second was raised explicitly in [5 Appendix A]. This paper answers the second question and narrows the first to two short windows. For the exact-solvency notion it also addresses a structural question: the hardness constructions for (D) use CDSs with non-unit notionals, which in Theorem 3.1 grow as the error approaches 11, and Kanellopoulos and Melissourgos [13] recently gave a polynomial algorithm for (D) at error 1/51/5 on a restricted class in which every core bank holds at most two CDSs of notional 11. How many unit contracts must a bank hold before (D) becomes hard? On a unit-notional normal form within that class we prove polynomial algorithms below, and PPAD-completeness from, an explicit held degree for every error in [1/2,1)[1/2,1) and for error 1/31/3, and PPAD-completeness at held degree 22 for every error below 1/91/9; assuming that PPAD is not contained in FP, this answers the question exactly at these errors.

Results

We work with five approximation notions (Definition 2.1): the weak notion (W), which bounds every residual by EE; the notion (I) of [10], which also fixes ex-ante solvent banks at recovery 11; the notion (D) of [5], which adds the clause that a bank with assets at least (1+E)(1 + E) times its liabilities recovers exactly 11; its variant (D∘)(D^\circ), which exempts banks without liabilities; and the clipped-ratio notion (S), modelled on [23]. A network is writer-solvent if every CDS writer is solvent ex ante, and one-writer if a single, ex-ante solvent bank writes all CDSs. Table 1 and Figure 1 summarize the results.

Thresholds for (I) and (W)

Figure 1. Thresholds for (I) and (W). Dark: PPAD-hard for every rational error in the range. Light: polynomial time. White: open window. The ticks mark the previously published hardness constants (2−3)/4≈0.067(2-\sqrt{3})/4 \approx0.067 for (I) [11] and 5−26≈0.1015-2\sqrt{6} \approx0.101 for (D) [5]; the second is for the exact-solvency notion (D), for which Theorem 3.1 gives hardness below 1, and is shown for comparison only.

Two principal parts. The first part concerns (I) and (W): hardness thresholds on general, writer-solvent and one-writer networks, a box algorithm whose thresholds are sharp for algorithms of bounded radius, and barriers for interval-certified reductions; two short windows remain open. The second part concerns the exact-solvency notion (D) on the restricted unit-notional class R(d)\mathcal{R}(d), which we classify by held degree. It concerns a different notion and a restricted class, and it does not move the windows for (I) and (W). Results on membership without non-degeneracy, on totality and on exact existence complete the picture. The main text states the results with their key constructions; every proof that is not in the main text is in the appendices.

General networks: hardness below EI∗E_I^*, algorithms above εlad\varepsilon_{\mathrm{lad}}. (I)-EE and (W)-EE are PPAD-complete for every rational E<EI∗=0.25299586…E < E_I^* = 0.25299586\ldots, the root in [1/5,27/100][1/5,27/100] of an explicit polynomial of degree 11 (Theorem 3.3). The construction encodes phases of bank pairs that clean signals step by step. It works exactly while the interval (τmin⁡(E),T(E))(\tau_{\min}(E),T(E)) of admissible thresholds for its PURIFY gadget is nonempty, that is, for E<EI∗E < E_I^*, and in the ideal limit EI∗E_I^* is the exact endpoint of this design family (Remark A.11). The box algorithm below solves both problems in polynomial time for every rational E>εlad=0.28336553…E > \varepsilon_{\mathrm{lad}} = 0.28336553\ldots, the root in (0,1/2)(0, 1/2) of 5E5−45E4+52E3−32E2+20E−45E^5 - 45E^4 + 52E^3 - 32E^2 + 20E - 4 (Theorem 6.3). The remaining window is [0.25299586,0.28336554][0.25299586, 0.28336554].

Writer-solvent networks: hardness below α\alpha, algorithms above 3−223 - 2\sqrt{2}. (I)-E is PPAD-complete on writer-solvent networks for every rational E<α=(13−153)/4=0.15767078…E < \alpha= (13 - \sqrt{153})/4 = 0.15767078\ldots, with one writer and, at every NAND gate, one seed receiver after two input buffers (Theorem 4.2). The box algorithm solves (I) and (W) on these networks for every rational E>3−22=0.17157287…E > 3 - 2\sqrt{2} = 0.17157287\ldots (Theorem 6.2). The remaining window is [0.15767078,0.17157288][0.15767078, 0.17157288].

One writer under (W): calibration copies. Under (W) the single writer is only approximately solvent, and a gadget that must work for every value of its recovery loses accuracy. We avoid this by building many copies of the whole circuit, each calibrated for a different value of the writer’s recovery, and decoding from the copy that matches (Theorem 4.3). The match is made by the decoder and not by the network, because no bank can be forced to react to the writer’s recovery (Remark 4.6); so each copy is a complete circuit, and the decoder reads every gate from the same copy. This gives PPAD-completeness of one-writer (W) for every rational E<αE < \alpha (Corollary 4.4). At E=157/1000E = 157/1000 the reduction uses 157 copies; the explicit instance has 17743 banks and 17898 CDSs (Remark C.5).

Equal thresholds. Writer-solvent (I), writer-solvent (W) and one-writer (W) have the same supremum of PPAD-hard rational errors and the same infimum of polynomially solvable ones (Theorem 5.1); so do (I) and (W) on non-degenerate networks (Corollary 5.2). These are statements about suprema and infima only; they say nothing about an individual error.

α\alpha is the exact endpoint of the chain-and-seed family. Within the family of NAND gadgets made of input chains, one seed receiver and an output chain, certified with three statuses, uniform gadgets exist exactly for E<αE < \alpha (Corollary C.13). In writer-solvent networks the dual-rail wires of the general construction do not help interval-certified gadgets, because all assets there are separable affine.

The box algorithm. Every bank carries an interval, initially [E,1−E][E, 1 - E]; each round computes an interval enclosing every value of the bank’s map on the current boxes; a bank whose enclosing interval has length at most 2E2E settles at the point of its box nearest to the midpoint, and every other bank shrinks its box to the enclosing interval narrowed by EE on each side. Every output is an (I)-EE vector (Lemma 6.1), although the boxes need not contain an exact clearing vector (Example 10.7). Ratio recursions show termination after a number of rounds that depends only on EE, above 3−223 - 2\sqrt{2} for writer-solvent networks and above εlad\varepsilon_{\mathrm{lad}} in general (Theorems 6.2 and 6.3). Both thresholds coincide with lower bounds for algorithms of bounded radius (Theorem 6.4), for (I) on writer-solvent networks and for (I) and (W) on general networks, so within the locality model they are sharp, and RR rounds of the algorithm are an optimal RR-local algorithm for writer-solvent (I) (Corollary 6.5). This optimality is a statement about bounded-radius algorithms only, not about polynomial-time algorithms in general. We also record that the writer-solvent local lower bound needs its hypothesis on every iterate, not only on the last; a counterexample at E=3/10E = 3/10, R=3R = 3 shows that the weaker hypothesis does not suffice (Remark D.4). Rounding the boxes outward to a grid of step δ\delta makes the algorithm stop after at most nM+1nM + 1 rounds with endpoints of polynomial size, at the price of an error E0+δ/2E_0 + \delta/2 for settled banks (Theorem 6.6); every writer-solvent instance is thereby reduced to selecting a point of a near-stalled box (Theorem 6.7). On networks whose CDS writers lie in FF and whose signed residual matrix is symmetric or monotone on each strongly connected component, such points can be selected in polynomial time, which gives a polynomial approximation scheme for (I) and (W) on that class (Corollary 11.1), for instance at E=1/6E = 1/6 inside the writer-solvent window; this does not move the window for unrestricted networks.

Barriers. The barriers concern the gadget model of Definitions 5.3 and 7.1: input wires are disjoint, output rails are receivers of the gadget (no output is an alias of an input rail), and every other bank enters as a fixed bank whose box does not depend on the condition. Within this model, for α≤E<1/2\alpha\le E < 1/2, no writer-solvent NAND gadget for (I) certified by interval propagation, of any topology (feedback, mixing receivers, rereads of raw inputs, intermediate values), has an output bound at most the smaller of its input bounds (Theorem 5.6). From an input bound at least the lower fixed point λ−\lambda_{-} of the inverter map, a unary gadget never produces an output bound below λ−\lambda_{-}; below λ−\lambda_{-} it never lowers the bound; and outside (λ−,λ+)(\lambda_{-}, \lambda_{+}), and for every input bound γ\gamma if E>3−22E > 3 - 2\sqrt{2}, every output bound is at least an uncapped transfer bound ψ(γ)\psi(\gamma), which is the bound of the best single receiver when it lies below 1−E1 - E and leaves no output wire at all otherwise (Theorem 7.2). No NAND gadget takes one input with bound at least λ+\lambda_{+} and the other with bound at least λ−\lambda_{-} (Theorem 7.3), and PURE-CIRCUIT instances over any of the PPAD-complete gate sets, realized by interval-certified gadgets with arbitrary bounds (one per wire), are solvable in polynomial time (Theorem 7.5). Unless PPAD is contained in FP, every escape route is capped at 3−223 - 2\sqrt{2} by the algorithm (Corollary 7.9). With the bound of a wire replaced by an effective bound computed from the intervals of its rails, these statements extend to wire interfaces in which each rail has an arbitrary fixed pair of disjoint low and high intervals, possibly non-saturated and different for the two rails of a wire (Proposition F.4 and Theorem 7.8). Gadgets certified on exact solution sets, correlation-aware certificates, alias outputs and other source problems remain open (§ 8.6).

(D) for every error below 1. (D)-EE is PPAD-complete on non-degenerate networks for every rational E∈(0,1)E \in(0, 1), already with one writer (Theorem 3.1); for E≥1E \ge1 it is trivial. The solvency clause forces exact values, so one receiver per NAND gate suffices and no error accumulates.

(D) at bounded held degree. On the restricted unit-notional class R(d)\mathcal{R}(d) (Definition 2.5), in which every core bank has no external assets, owes a unit debt and holds at most dd CDSs of notional 1, counted with multiplicity, we classify (D) by dd (Theorem 8.1). Let ρ=(1+E)/(1−E)\rho= (1 + E)/(1 - E). For every rational E∈[1/2,1)E \in[1/2, 1), (D)-EE is solvable in polynomial time for d<(∣ρ∣+1)ρd < (|\rho| + 1)\rho and PPAD-complete for d≥(∣ρ∣+1)ρd \ge(|\rho| + 1)\rho; at E=1/3E = 1/3 it is solvable in polynomial time for d≤5d \le5 and PPAD-complete for d≥6d \ge6. It is PPAD-complete at held degree 4 for E≤3/13E \le3/13, at held degree 3 for E<1/7E < 1/7 and at held degree 2 for E<1/9E < 1/9, while held degree 1 admits an exact clearing vector in linear time. Assuming that PPAD is not contained in FP, the threshold error pdp_d is determined for d∈{6,7}d \in\{6,7\} and all d≥12d \ge12, it is itself a PPAD-hard error, and d(1−pd)→2\sqrt{d}(1 - p_d) \to2; Table 3 gives the full phase diagram and the degrees that remain open. Hardness holds also for (D°) and (S). The lower bounds use the sparse NAND and two-arm PURIFY topology, which appears with weighted contracts in [5] and in Theorem 3.1, with a new placement of unit multiplicities (Theorem 8.2), and add restoring chains at low degree (Theorem 8.5); the upper bounds refine the supported propagation of [13] (Theorems 8.7 to 8.9). Each method is tight at its own boundary, for its own decoder (Appendix § 31). These results concern (D) only: on R(d)\mathcal{R}(d), (I) and (W) are solvable in polynomial time for every error above 3−223 - 2\sqrt{2} at every degree (by the box algorithm below 1/21/2 and trivially from 1/21/2 on), so the windows for (I) and (W) are unchanged.

error EEρ\rhoFP for held degreePPAD-hard for held degreeunresolved
1/2≤E<11/2 \le E < 1ρ≥3\rho\ge3d<(m+1)ρd < (m+1)\rhod≥(m+1)ρd \ge(m+1)\rhonone
1/3<E<1/21/3 < E < 1/22<ρ<32 < \rho< 3d<4ρ−1d < 4\rho- 1d≥4ρd \ge4\rhod=⌈4ρ⌉−1d = \lceil4\rho\rceil- 1
E=1/3E = 1/322d≤5d \le5d≥6d \ge6none
1/4≤E<1/31/4 \le E < 1/35/3≤ρ<25/3 \le\rho< 2d<3ρ−1d < 3\rho- 1d≥3ρd \ge3\rhod=⌈3ρ⌉−1d = \lceil3\rho\rceil- 1
3/13<E<1/43/13 < E < 1/48/5<ρ<5/38/5 < \rho< 5/3d≤2d \le2d≥5d \ge53, 4
1/5≤E≤3/131/5 \le E \le3/133/2≤ρ≤8/53/2 \le\rho\le8/5d≤2d \le2d≥4d \ge43
1/7≤E<1/51/7 \le E < 1/54/3≤ρ<3/24/3 \le\rho< 3/2d≤1d \le1d≥4d \ge42, 3
1/9≤E<1/71/9 \le E < 1/75/4≤ρ<4/35/4 \le\rho< 4/3d≤1d \le1d≥3d \ge32
0<E<1/90 < E < 1/91<ρ<5/41 < \rho< 5/4d≤1d \le1d≥2d \ge2none

Table 3. Phase diagram of (D)-EE on R(d)\mathcal{R}(d) for fixed rational E∈(0,1)E \in(0,1), with m=⌈ρ⌉m = \lceil\rho\rceil. “FP” lists the held degrees with a polynomial algorithm and “PPAD-hard” those with a hardness proof; both columns are unconditional. “Unresolved” means not settled by the results of this paper and the sources checked. The FP entries with d≤2d \le2 below E=1/4E = 1/4 are the exact algorithm at held degree 1 (Theorem 8.5(c)) and (D)-EE at held degree 2 for E≥1/5E \ge1/5 [13 Theorem F.9], reproved as the case a=1a = 1, Q=2Q = 2 of Theorem J.1.

Membership without non-degeneracy. (W)-EE and (I)-EE are in PPAD on all networks, with EE given in binary (Theorem 9.1): capping recoveries at 1−E/21 - E/2 keeps every nonzero liability bounded away from zero, at the cost of an additive E/2E/2. In particular (W)-EE vectors exist on every network for every E>0E > 0.

The exempted notion. (D∘^\circ)-EE and (S)-EE are in PPAD on all networks, by a rounding that snaps recoveries to 1 across an empty interval among n+1n + 1 geometric scales (Theorem 9.2), and they are PPAD-complete for every fixed rational E∈(0,1)E \in(0,1) (Corollary 9.3).

(D) is not total. Without non-degeneracy, (D)-EE vectors need not exist: a network with three banks has none, for every E∈(0,1)E \in(0,1) and every convention for 0/0 (Proposition 9.4). So the question of [5 Appendix A] has a negative answer for (D) as written and a positive one for (D∘^\circ).

Exact existence and stalled boxes. Writer-solvent networks always have exact clearing vectors (Proposition 10.1); for non-degenerate networks this is known [5, 9], and the assumption cannot be dropped (Proposition 10.2). Where the box algorithm stalls on writer-solvent networks of inverters, the stall determines an affine system whose solution, when it lies in the stalled box, is exact on the unsettled banks and, with the settled points, forms an (I)-EE vector, which is an exact clearing vector of the whole network if, in addition, no bank with ei<Limax⁡e_i < L_i^{\max} settled before the stall (Propositions 10.4 and 10.5). The solution does lie in the box when two banks are unsettled and for symmetric cycles of any length (Proposition 10.6), and it did in all 28 stalls of a computer search reported in [26 record Lsolo] (Observation K.1); but it does not in general: an example with three unsettled banks inside the writer-solvent window has no exact clearing vector in its stalled box (Example 10.7). A global rule for stalled configurations remains open (Question 10.8). At exact inverter stalls the selectors are exactly the points of finitely many polyhedra, one for each set of saturated banks held at the top of their boxes (a point of such a polyhedron may have fewer clipped banks, Proposition L.2); this family need not be closed under intersection (Proposition L.5), an exact run can converge without ever stalling (Proposition L.6), and even an affine residual band can be infeasible on a reached stalled box (Proposition L.7).

Conventions of this paper

Status labels. Statements marked [KNOWN] are from the literature. Every other theorem, proposition, lemma and corollary has a complete proof in this paper, or, where explicitly indicated, a precise pointer to the research record in which the proof is written out. Statements marked [COMPUTATIONAL] report exact finite computations or numerical diagnostics, as stated in each case; they support the proofs but are never used in place of them.

References

  1. [1]Ozan Candogan, Asuman Ozdaglar, and Pablo A. Parrilo. Near-potential games: Geometry and dynamics. ACM Transactions on Economics and Computation, 1(2):1–32, 2013. doi:10.1145/2465769.2465776.DOI
  2. [2]Argyrios Deligkas, John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos. Pure-Circuit: Strong inapproximability for PPAD. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pages 159–170, 2022. Full version: arXiv:2209.15149. doi:10.1109/FOCS54457.2022.00022.DOI
  3. [3]Argyrios Deligkas, John Fearnley, Alexandros Hollender, and Themistoklis Melissourgos. Pure-Circuit: Tight inapproximability for PPAD. Journal of the ACM, 71(5):31:1–31:48, 2024. doi:10.1145/3678166.DOI
  4. [4]Jérémi Do Dinh and Alexandros Hollender. Tight inapproximability of Nash equilibria in public goods games. Information Processing Letters, 186, 2024. Article 106486. doi:10.1016/j.ipl.2024.106486.DOI
  5. [5]Simon Dohn, Kristoffer Arnsfelt Hansen, and Asger Klinkby. Improved hardness results for the clearing problem in financial networks with credit default swaps. arXiv:2409.18717, version 1 (27 September 2024). Conference version in Algorithmic Game Theory (SAGT 2025), Lecture Notes in Computer Science 15953, 81–98, Springer, 2026 (first online 1 September 2025), doi:10.1007/978-3-032-03639-1_5. Section, appendix and definition numbers refer to the arXiv version, 2024.DOI
  6. [6]Larry Eisenberg and Thomas H. Noe. Systemic risk in financial systems. Management Science, 47(2):236–249, 2001. doi:10.1287/mnsc.47.2.236.9835.DOI
  7. [7]Kousha Ettessami and Mihalis Yannakakis. On the complexity of Nash equilibria and other fixed points. SIAM Journal on Computing, 39(6):2531–2597, 2010. doi:10.1137/080720826.
  8. [8]Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre. Strong approximations and irrationality in financial networks with financial derivatives. arXiv:2109.06608, version 2 (14 January 2022), 2021.arxiv.org/abs/2109.06608
  9. [9]Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre. Strong approximations and irrationality in financial networks with derivatives. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), volume 229 of LIPIcs, pages 76:1–76:18, 2022. doi:10.4230/LIPIcs.ICALP.2022.76.DOI
  10. [10]Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre. Clearing financial networks with derivatives: From intractability to algorithms. arXiv:2312.05139, version 2 (13 December 2023), 2023.arxiv.org/abs/2312.05139
  11. [11]Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre. Clearing financial networks with derivatives: From intractability to algorithms. Information and Computation, 312, 2026. Article 105480. doi:10.1016/j.ic.2026.105480.DOI
  12. [12]Stavros D. Ioannidis, Bart de Keijzer, and Carmine Ventre. Strong approximations and irrationality in financial networks with derivatives. ACM Transactions on Algorithms, 22(3):1–48, 2026. Article 32. doi:10.1145/3818605.DOI
  13. [13]Panagiotis Kanellopoulos and Themistoklis Melissourgos. Tight inapproximability for generalized circuits. arXiv:2610.26772, version 1 (19 October 2026). Theorem 3.4 and Appendix F.1 cited by number, 2026.arxiv.org/abs/2610.26772
  14. [14]Masakazu Kojima, Shinji Mizuno, and Akiko Yoshise. A polynomial-time algorithm for a class of linear complementarity problems. Mathematical Programming, 44(1):1–26, 1989. doi:10.1007/BF01587074.DOI
  15. [15]G. M. Korpelevich. The extragradient method for finding saddle points and other problems. Ekonomika i Matematicheskie Metody, 12(4):747–756, 1976. In Russian.
  16. [16]Dennis McLaughlin. Central counterparty capital and nondefault losses. Journal of Financial Market Infrastructures, 10(1):1–21, 2021. doi:10.21314/JFMI.2021.010.DOI
  17. [17]Dennis McLaughlin. The trade-off between shorter settlement times and multilateral netting benefits in deferred net settlement. Journal of Financial Market Infrastructures, 11(1):1–17, 2023. doi:10.21314/JFMI.2023.005.DOI
  18. [18]Christos Papadimitriou and Binghui Peng. Public goods games in directed networks. arXiv:2106.00718, version 2 (14 July 2021), 2021.arxiv.org/abs/2106.00718
  19. [19]Christos H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Sciences, 48(3):498–532, 1994. doi:10.1016/S0022-0000(05)80063-7.DOI
  20. [20]Francesca Parise and Asuman Ozdaglar. A variational inequality framework for network games: Existence, uniqueness, convergence and sensitivity analysis. Games and Economic Behavior, 114:47–82, 2019. doi:10.1016/j.geb.2018.11.012.DOI
  21. [21]L. C. G. Rogers and L. A. M. Veraart. Failure and rescue in an interbank network. Management Science, 59(4):882–898, 2013. doi:10.1287/mnsc.1120.1569.DOI
  22. [22]Steffen Schuldenzucker, Sven Seuken, and Stefano Battiston. Clearing payments in financial networks with credit default swaps [extended abstract]. In Proceedings of the 2016 ACM Conference on Economics and Computation (EC ’16), page 759. ACM, 2016. doi:10.1145/2940716.2940791.DOI
  23. [23]Steffen Schuldenzucker, Sven Seuken, and Stefano Battiston. Finding clearing payments in financial networks with credit default swaps is PPAD-complete. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), volume 67 of LIPIcs, pages 32:1–32:20, 2017. doi:10.4230/LIPIcs.ITCS.2017.32.DOI
  24. [24]Steffen Schuldenzucker, Sven Seuken, and Stefano Battiston. The computational complexity of financial networks with credit default swaps. arXiv:1710.01578, version 3 (20 May 2019), 2019.arxiv.org/abs/1710.01578
  25. [25]Steffen Schuldenzucker, Sven Seuken, and Stefano Battiston. Default ambiguity: Credit default swaps create new systemic risks in financial networks. Management Science, 66(5):1981–1998, 2020. doi:10.1287/mnsc.2019.3304.
  26. [26]Approximate clearing in financial networks with credit default swaps: public scientific support, version 2.0. Curated archive cds-clearing-support-v2.0, 30 October 2026; see its files README.md, REPRODUCING.md, CHECKS.md and PROVENANCE.md. doi:10.5281/zenodo.23834566.

Paper details

vlnc:W_vrpqcg8w
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents