{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:27:10Z","timestamp":1780338430955,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","funder":[{"name":"EPSRC","award":["EP\/X039862\/1"],"award-info":[{"award-number":["EP\/X039862\/1"]}]},{"name":"UKRI Centre for Doctoral Training in Safe and Trusted Artificial Intelligence","award":["EP\/S023356\/1"],"award-info":[{"award-number":["EP\/S023356\/1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,15]]},"DOI":"10.1145\/3768292.3770401","type":"proceedings-article","created":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:24:26Z","timestamp":1763105066000},"page":"614-622","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast Monitoring of Systemic Risk in Financial Networks with Credit Default Swaps"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-9155-8730","authenticated-orcid":false,"given":"Jinyun","family":"Tong","sequence":"first","affiliation":[{"name":"Department of Informatics, King's College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5749-5292","authenticated-orcid":false,"given":"Stavros D.","family":"Ioannidis","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Royal Holloway, University of London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4310-4004","authenticated-orcid":false,"given":"Sriram Bharadwaj","family":"Rangarajan","sequence":"additional","affiliation":[{"name":"UKRI Centre for Doctoral Training in Safe and Trusted AI, Department of Informatics, King's College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9465-0837","authenticated-orcid":false,"given":"Bart","family":"de Keijzer","sequence":"additional","affiliation":[{"name":"Department of Informatics, King's College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1464-1215","authenticated-orcid":false,"given":"Carmine","family":"Ventre","sequence":"additional","affiliation":[{"name":"Department of Informatics, King's College London, London, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"crossref","unstructured":"R\u00e9ka Albert and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2002. Statistical mechanics of complex networks. Reviews of modern physics 74 1 (2002) 47.","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_3_3_2_3_2","first-page":"46:1\u201346:16","volume-title":"11th Innovations in Theoretical Computer Science Conference (ITCS 2020)","volume":"151","author":"Bertschinger Nils","year":"2020","unstructured":"Nils Bertschinger, Martin Hoefer, and Daniel Schmand. 2020. Strategic Payments in Financial Networks. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) , Vol.\u00a0151. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 46:1\u201346:16."},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Xi Chen Xiaotie Deng and Shang-Hua Teng. 2009. Settling the complexity of computing two-player Nash equilibria. Journal of the ACM (JACM) 56 3 (2009) 1\u201357.","DOI":"10.1145\/1516512.1516516"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Constantinos Daskalakis Paul\u00a0W Goldberg and Christos\u00a0H Papadimitriou. 2009. The complexity of computing a Nash equilibrium. Commun. ACM 52 2 (2009) 89\u201397.","DOI":"10.1145\/1461928.1461951"},{"key":"e_1_3_3_2_6_2","first-page":"81","volume-title":"International Symposium on Algorithmic Game Theory","author":"Dohn Simon","year":"2025","unstructured":"Simon Dohn, Kristoffer\u00a0Arnsfelt Hansen, and Asger Klinkby. 2025. Improved Hardness Results for the Clearing Problem in Financial Networks with Credit Default Swaps. In International Symposium on Algorithmic Game Theory. Springer, 81\u201398."},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Larry Eisenberg and Thomas\u00a0H Noe. 2001. Systemic risk in financial systems. Management Science 47 2 (2001) 236\u2013249.","DOI":"10.1287\/mnsc.47.2.236.9835"},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Kousha Etessami and Mihalis Yannakakis. 2010. On the complexity of Nash equilibria and other fixed points. SIAM J. Comput. 39 6 (2010) 2531\u20132597.","DOI":"10.1137\/080720826"},{"key":"e_1_3_3_2_9_2","unstructured":"Henri Froese Martin Hoefer and Lisa Wilhelmi. 2023. The complexity of debt swapping. arXiv abs\/2302.11250 (2023)."},{"key":"e_1_3_3_2_10_2","first-page":"42:1\u201342:17","volume-title":"41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France","author":"Hoefer Martin","year":"2024","unstructured":"Martin Hoefer, Carmine Ventre, and Lisa Wilhelmi. 2024. Algorithms for Claims Trading. In 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 42:1\u201342:17."},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15714-1_11"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15714-1_12"},{"key":"e_1_3_3_2_13_2","first-page":"76:1\u201376:18","volume-title":"49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)","author":"Ioannidis Stavros\u00a0D","year":"2022","unstructured":"Stavros\u00a0D Ioannidis, Bart de\u00a0Keijzer, and Carmine Ventre. 2022. Strong approximations and irrationality in financial networks with derivatives. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) , Vol.\u00a0229. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 76:1\u201376:18."},{"key":"e_1_3_3_2_14_2","doi-asserted-by":"crossref","unstructured":"Stavros\u00a0D Ioannidis Bart de\u00a0Keijzer and Carmine Ventre. 2023. Clearing Financial Networks with Derivatives: From Intractability to Algorithms. arXiv abs\/2312.05139 (2023).","DOI":"10.2139\/ssrn.4980490"},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3490354.3494391"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/48"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/3545946.3598645"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","unstructured":"King\u2019s College London. 2024. King\u2019s Computational Research Engineering and Technology Environment (CREATE). 10.18742\/rnvf-m076.","DOI":"10.18742\/rnvf-m076"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3490354.3494385"},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Christos\u00a0H Papadimitriou. 1994. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and system Sciences 48 3 (1994) 498\u2013532.","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"e_1_3_3_2_21_2","first-page":"91:1\u201391:17","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference)","author":"Papp P\u00e1l\u00a0Andr\u00e1s","year":"2020","unstructured":"P\u00e1l\u00a0Andr\u00e1s Papp and Roger Wattenhofer. 2020. Network-Aware Strategies in Financial Systems. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 91:1\u201391:17."},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/3465456.3467638"},{"key":"e_1_3_3_2_23_2","first-page":"52:1\u201352:20","volume-title":"12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference","author":"Papp P\u00e1l\u00a0Andr\u00e1s","year":"2021","unstructured":"P\u00e1l\u00a0Andr\u00e1s Papp and Roger Wattenhofer. 2021. Sequential Defaulting in Financial Networks. In 12th Innovations in Theoretical Computer Science Conference, ITCS 2021, January 6-8, 2021, Virtual Conference. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 52:1\u201352:20."},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-94676-0_22"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"crossref","unstructured":"Leonard\u00a0CG Rogers and Luitgard\u00a0AM Veraart. 2013. Failure and rescue in an interbank network. Management Science 59 4 (2013) 882\u2013898.","DOI":"10.1287\/mnsc.1120.1569"},{"key":"e_1_3_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3391403.3399538"},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2940716.2940791"},{"key":"e_1_3_3_2_28_2","unstructured":"Steffen Schuldenzucker Sven Seuken and Stefano Battiston. 2017. The computational complexity of clearing financial networks with credit default swaps. arXiv abs\/1710.01578 (2017)."},{"key":"e_1_3_3_2_29_2","unstructured":"Steffen Schuldenzucker Sven Seuken and Stefano Battiston. 2017. Finding clearing payments in financial networks with credit default swaps is PPAD-complete. LIPIcs: Leibniz International Proceedings in Informatics 67 (2017) 32:1\u201332:20."},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"crossref","unstructured":"Steffen Schuldenzucker Sven Seuken and Stefano Battiston. 2020. Default ambiguity: Credit default swaps create new systemic risks in financial networks. Management Science 66 5 (2020) 1981\u20131998.","DOI":"10.1287\/mnsc.2019.3304"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA240891"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"crossref","unstructured":"Mihalis Yannakakis. 2009. Equilibria fixed points and complexity classes. Computer Science Review 3 2 (2009) 71\u201385.","DOI":"10.1016\/j.cosrev.2009.03.004"}],"event":{"name":"ICAIF '25: 6th ACM International Conference on AI in Finance","location":"Singapore Singapore","acronym":"ICAIF '25"},"container-title":["Proceedings of the 6th ACM International Conference on AI in Finance"],"original-title":[],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:25:45Z","timestamp":1763105145000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3768292.3770401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":31,"alternative-id":["10.1145\/3768292.3770401","10.1145\/3768292"],"URL":"https:\/\/doi.org\/10.1145\/3768292.3770401","relation":{},"subject":[],"published":{"date-parts":[[2025,11,14]]},"assertion":[{"value":"2025-11-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}