{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T16:05:31Z","timestamp":1784995531656,"version":"3.55.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032036384","type":"print"},{"value":"9783032036391","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-03639-1_5","type":"book-chapter","created":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T13:23:49Z","timestamp":1756646629000},"page":"81-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Hardness Results for\u00a0the\u00a0Clearing Problem in\u00a0Financial Networks with\u00a0Credit Default Swaps"],"prefix":"10.1007","author":[{"given":"Simon","family":"Dohn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1155-8072","authenticated-orcid":false,"given":"Kristoffer\u00a0Arnsfelt","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Asger","family":"Klinkby","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,1]]},"reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10208-007-9006-9","volume":"9","author":"P B\u00fcrgisser","year":"2009","unstructured":"B\u00fcrgisser, P., Cucker, F.: Exotic quantifiers, complexity classes, and complete problems. Found. Comput. Math. 9(2), 135\u2013170 (2009). https:\/\/doi.org\/10.1007\/s10208-007-9006-9","journal-title":"Found. Comput. Math."},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Chen, X., Deng, X., Teng, S.: Settling the complexity of computing two-player Nash equilibria. J. ACM 56(3), 14:1\u201314:57 (2009). https:\/\/doi.org\/10.1145\/1516512.1516516","DOI":"10.1145\/1516512.1516516"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Deligkas, A., Fearnley, J., Hollender, A., Melissourgos, T.: Pure-circuit: strong inapproximability for PPAD. In: FOCS, pp. 159\u2013170. IEEE (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00022","DOI":"10.1109\/FOCS54457.2022.00022"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Dohn, S., Hansen, K.A., Klinkby, A.: Improved hardness results for the clearing problem in financial networks with credit default swaps. CoRR abs\/2409.18717 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2409.18717","DOI":"10.48550\/ARXIV.2409.18717"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1287\/mnsc.47.2.236.9835","volume":"47","author":"L Eisenberg","year":"2001","unstructured":"Eisenberg, L., Noe, T.H.: Systemic risk in financial systems. Manag. Sci. 47(2), 236\u2013249 (2001). https:\/\/doi.org\/10.1287\/mnsc.47.2.236.9835","journal-title":"Manag. Sci."},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1137\/080720826","volume":"39","author":"K Etessami","year":"2010","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. SIAM J. Comput. 39(6), 2531\u20132597 (2010). https:\/\/doi.org\/10.1137\/080720826","journal-title":"SIAM J. Comput."},{"issue":"7","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1007\/S00224-018-9887-9","volume":"63","author":"KA Hansen","year":"2019","unstructured":"Hansen, K.A.: The real computational complexity of minmax value and equilibrium refinements in multi-player games. Theory Comput. Syst. 63(7), 1554\u20131571 (2019). https:\/\/doi.org\/10.1007\/S00224-018-9887-9","journal-title":"Theory Comput. Syst."},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Ioannidis, S.D., de\u00a0Keijzer, B., Ventre, C.: Strong approximations and irrationality in financial networks with derivatives. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) ICALP 2022. LIPIcs, vol.\u00a0229, pp. 76:1\u201376:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.76","DOI":"10.4230\/LIPIcs.ICALP.2022.76"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Ioannidis, S.D., de\u00a0Keijzer, B., Ventre, C.: Clearing financial networks with derivatives: from intractability to algorithms. CoRR abs\/2312.05139 (2023). https:\/\/doi.org\/10.48550\/arXiv.2312.05139","DOI":"10.48550\/arXiv.2312.05139"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80063-7","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"5_CR11","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1287\/mnsc.1120.1569","volume":"59","author":"LCG Rogers","year":"2013","unstructured":"Rogers, L.C.G., Veraart, L.A.M.: Failure and rescue in an interbank network. Manag. Sci. 59(4), 882\u2013898 (2013). https:\/\/doi.org\/10.1287\/mnsc.1120.1569","journal-title":"Manag. Sci."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-11805-0_32","volume-title":"Graph Drawing","author":"M Schaefer","year":"2010","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Realizability of graphs and linkages. In: Pach, J. (ed.) Thirty Essays on Geometric Graph Theory, pp. 461\u2013482. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-0110-0_24","DOI":"10.1007\/978-1-4614-0110-0_24"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2015","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2015). https:\/\/doi.org\/10.1007\/s00224-015-9662-0","journal-title":"Theory Comput. Syst."},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Schuldenzucker, S., Seuken, S., Battiston, S.: The computational complexity of financial networks with credit default swaps. CoRR abs\/1710.01578 (2019). https:\/\/doi.org\/10.48550\/arXiv.1710.01578. Working Paper","DOI":"10.48550\/arXiv.1710.01578"},{"issue":"5","key":"5_CR16","doi-asserted-by":"publisher","first-page":"1981","DOI":"10.1287\/mnsc.2019.3304","volume":"66","author":"S Schuldenzucker","year":"2020","unstructured":"Schuldenzucker, S., Seuken, S., Battiston, S.: Default ambiguity: credit default swaps create new systemic risks in financial networks. Manag. Sci. 66(5), 1981\u20131998 (2020). https:\/\/doi.org\/10.1287\/mnsc.2019.3304","journal-title":"Manag. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-03639-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T15:37:33Z","timestamp":1784993853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-03639-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"ISBN":["9783032036384","9783032036391"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-03639-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"assertion":[{"value":"1 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bath","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}