{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:21:23Z","timestamp":1783153283272,"version":"3.54.6"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100014013","name":"UKRI","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/X039862\/1"],"award-info":[{"award-number":["EP\/X039862\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/X021696\/1"],"award-info":[{"award-number":["EP\/X021696\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/W034042\/1"],"award-info":[{"award-number":["EP\/W034042\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["UKRI4151"],"award-info":[{"award-number":["UKRI4151"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ic.2026.105480","type":"journal-article","created":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T07:27:58Z","timestamp":1780298878000},"page":"105480","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Clearing financial networks with derivatives: From intractability to algorithms"],"prefix":"10.1016","volume":"312","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5749-5292","authenticated-orcid":false,"given":"Stavros D.","family":"Ioannidis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bart","family":"de Keijzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1464-1215","authenticated-orcid":false,"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ic.2026.105480_bib0001","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/mnsc.47.2.236.9835","article-title":"Systemic risk in financial systems","volume":"47","author":"Eisenberg","year":"2001","journal-title":"Manag. Sci."},{"issue":"5","key":"10.1016\/j.ic.2026.105480_bib0002","doi-asserted-by":"crossref","first-page":"1981","DOI":"10.1287\/mnsc.2019.3304","article-title":"Default ambiguity: credit default swaps create new systemic risks in financial networks","volume":"66","author":"Schuldenzucker","year":"2020","journal-title":"Manag. Sci."},{"key":"10.1016\/j.ic.2026.105480_bib0003","series-title":"ITCS","first-page":"32:1","article-title":"Finding clearing payments in financial networks with credit default swaps is PPAD-complete","volume":"67","author":"Schuldenzucker","year":"2017"},{"key":"10.1016\/j.ic.2026.105480_bib0004","series-title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)","article-title":"Strong approximations and irrationality in financial networks with derivatives","author":"Ioannidis","year":"2022"},{"issue":"5","key":"10.1016\/j.ic.2026.105480_bib0005","doi-asserted-by":"crossref","first-page":"31:1","DOI":"10.1145\/3678166","article-title":"Pure-circuit: tight inapproximability for PPAD","volume":"71","author":"Deligkas","year":"2024","journal-title":"J. ACM"},{"key":"10.1016\/j.ic.2026.105480_bib0006","series-title":"Web and Internet Economics: 17th International Conference, WINE 2021, Potsdam, Germany, December 14\u201317, 2021, Proceedings","first-page":"391","article-title":"Default ambiguity: finding the best solution to the clearing problem","author":"Papp","year":"2022"},{"issue":"4","key":"10.1016\/j.ic.2026.105480_bib0007","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1287\/mnsc.1120.1569","article-title":"Failure and rescue in an interbank network","volume":"59","author":"Rogers","year":"2013","journal-title":"Manag. Sci."},{"key":"10.1016\/j.ic.2026.105480_bib0008","series-title":"Proceedings of the 22nd ACM Conference on Economics and Computation","first-page":"765","article-title":"Debt swapping for risk mitigation in financial networks","author":"Papp","year":"2021"},{"key":"10.1016\/j.ic.2026.105480_bib0009","series-title":"EC","first-page":"79","article-title":"Portfolio compression in financial networks: incentives and systemic risk","author":"Schuldenzucker","year":"2020"},{"key":"10.1016\/j.ic.2026.105480_bib0010","series-title":"STACS","first-page":"42:1","article-title":"Algorithms for claims trading","volume":"289","author":"Hoefer","year":"2024"},{"key":"10.1016\/j.ic.2026.105480_bib0011","article-title":"The complexity of debt swapping","author":"Froese","year":"2023","journal-title":"CoRR"},{"key":"10.1016\/j.ic.2026.105480_bib0012","series-title":"SAGT","first-page":"187","article-title":"Seniorities and minimal clearing in financial network games","volume":"13584","author":"Hoefer","year":"2022"},{"issue":"7","key":"10.1016\/j.ic.2026.105480_bib0013","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1086\/719758","article-title":"Bail-ins and bailouts: incentives, connectivity, and systemic stability","volume":"130","author":"Bernard","year":"2022","journal-title":"J. Polit. Econ."},{"key":"10.1016\/j.ic.2026.105480_bib0014","unstructured":"B. Egressy, R. Wattenhofer, Bailouts in financial networks, (2021). arXiv preprint arXiv: 2106.12315."},{"issue":"7","key":"10.1016\/j.ic.2026.105480_bib0015","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1093\/rfs\/hhad096","article-title":"Credit freezes, equilibrium multiplicity, and optimal bailouts in financial networks","volume":"37","author":"Jackson","year":"2024","journal-title":"Rev. Financ. Stud."},{"key":"10.1016\/j.ic.2026.105480_bib0016","series-title":"International Symposium on Algorithmic Game Theory","first-page":"205","article-title":"Financial networks with singleton liability priorities","author":"Ioannidis","year":"2022"},{"key":"10.1016\/j.ic.2026.105480_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2023.113965","article-title":"Financial networks with singleton liability priorities","volume":"963","author":"Ioannidis","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105480_bib0018","series-title":"ICALP","first-page":"91:1","article-title":"Network-aware strategies in financial systems","volume":"168","author":"Papp","year":"2020"},{"key":"10.1016\/j.ic.2026.105480_bib0019","series-title":"ITCS","first-page":"52:1","article-title":"Sequential defaulting in financial networks","volume":"185","author":"Papp","year":"2021"},{"key":"10.1016\/j.ic.2026.105480_bib0020","series-title":"11th Innovations in Theoretical Computer Science Conference (ITCS 2020)","article-title":"Strategic payments in financial networks","author":"Bertschinger","year":"2020"},{"key":"10.1016\/j.ic.2026.105480_bib0021","series-title":"Proceedings of the Second ACM International Conference on AI in Finance","first-page":"1","article-title":"Financial network games","author":"Kanellopoulos","year":"2021"},{"key":"10.1016\/j.ic.2026.105480_bib0022","series-title":"AAMAS","first-page":"1651","article-title":"Forgiving debt in financial network games","author":"Kanellopoulos","year":"2022"},{"key":"10.1016\/j.ic.2026.105480_bib0023","series-title":"AAMAS","first-page":"260","article-title":"Debt transfers in financial networks: complexity and equilibria","author":"Kanellopoulos","year":"2023"},{"issue":"3","key":"10.1016\/j.ic.2026.105480_bib0024","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","article-title":"On the complexity of the parity argument and other inefficient proofs of existence","volume":"48","author":"Papadimitriou","year":"1994","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.ic.2026.105480_bib0025","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1461928.1461951","article-title":"The complexity of computing a Nash equilibrium","volume":"52","author":"Daskalakis","year":"2009","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/j.ic.2026.105480_bib0026","doi-asserted-by":"crossref","first-page":"14:1","DOI":"10.1145\/1516512.1516516","article-title":"Settling the complexity of computing two-player Nash equilibria","volume":"56","author":"Chen","year":"2009","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.ic.2026.105480_bib0027","doi-asserted-by":"crossref","first-page":"2531","DOI":"10.1137\/080720826","article-title":"On the complexity of Nash equilibria and other fixed points","volume":"39","author":"Etessami","year":"2010","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.ic.2026.105480_bib0028","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.cosrev.2009.03.004","article-title":"Equilibria, fixed points, and complexity classes","volume":"3","author":"Yannakakis","year":"2009","journal-title":"Comput. Sci. Rev."},{"key":"10.1016\/j.ic.2026.105480_bib0029","series-title":"EC","first-page":"113","article-title":"Computational complexity of proper equilibrium","author":"Hansen","year":"2018"},{"key":"10.1016\/j.ic.2026.105480_bib0030","series-title":"ICALP","first-page":"24:1","article-title":"Strong approximate consensus halving and the Borsuk-Ulam theorem","volume":"198","author":"Batziou","year":"2021"},{"issue":"1","key":"10.1016\/j.ic.2026.105480_bib0031","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1137\/21M1435823","article-title":"On the complexity of equilibrium computation in first-price auctions","volume":"52","author":"Filos-Ratsikas","year":"2023","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.ic.2026.105480_bib0032","series-title":"FOCS","first-page":"827","article-title":"FIXP-membership via convex optimization: games, cakes, and markets","author":"Filos-Ratsikas","year":"2021"},{"key":"10.1016\/j.ic.2026.105480_bib0033","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.jcss.2021.05.004","article-title":"The hairy ball problem is PPAD-complete","volume":"122","author":"Goldberg","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.ic.2026.105480_bib0034","series-title":"International Symposium on Fundamentals of Computation Theory","first-page":"259","article-title":"Computational complexity of computing a quasi-proper equilibrium","author":"Hansen","year":"2021"},{"key":"10.1016\/j.ic.2026.105480_bib0035","series-title":"63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31, - November 3, 2022","first-page":"159","article-title":"Pure-circuit: strong inapproximability for PPAD","author":"Deligkas","year":"2022"},{"key":"10.1016\/j.ic.2026.105480_bib0036","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2024.106486","article-title":"Tight inapproximability of Nash equilibria in public goods games","volume":"186","author":"Do Dinh","year":"2024","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ic.2026.105480_bib0037","series-title":"EC","first-page":"13","article-title":"Constant inapproximability for fisher markets","author":"Deligkas","year":"2024"},{"issue":"1","key":"10.1016\/j.ic.2026.105480_bib0038","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1146\/annurev-financial-121415-032806","article-title":"Credit default swaps: past, present, and future","volume":"8","author":"Augustin","year":"2016","journal-title":"Annu. Rev. Financ. Econ."},{"issue":"2","key":"10.1016\/j.ic.2026.105480_bib0039","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","article-title":"On total functions, existence theorems and computational complexity","volume":"81","author":"Megiddo","year":"1991","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105480_bib0040","series-title":"Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing","first-page":"409","article-title":"Inapproximability of Nash equilibrium","author":"Rubinstein","year":"2015"},{"key":"10.1016\/j.ic.2026.105480_bib0041","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0357-2","article-title":"First-Order Logic and Automated Theorem Proving","author":"Fitting","year":"1990"},{"key":"10.1016\/j.ic.2026.105480_bib0042","article-title":"The computational complexity of clearing financial networks with credit default swaps","author":"Schuldenzucker","year":"2017","journal-title":"CoRR"},{"key":"10.1016\/j.ic.2026.105480_bib0043","series-title":"SAGT","first-page":"81","article-title":"Improved hardness results for the clearing problem in financial networks with credit default swaps","volume":"15953","author":"Dohn","year":"2025"},{"key":"10.1016\/j.ic.2026.105480_bib0044","series-title":"Proceedings of the 6th ACM International Conference on AI in Finance","first-page":"614","article-title":"Fast monitoring of systemic risk in financial networks with credit default swaps","author":"Tong","year":"2025"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0890540126000775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T08:13:17Z","timestamp":1783152797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0890540126000775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":44,"alternative-id":["S0890540126000775"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105480","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Clearing financial networks with derivatives: From intractability to algorithms","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105480","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"105480"}}