Pure-circuit: strong inapproximability for PPAD

DOI10.1109/FOCS54457.2022.00022MaRDI QIDQ6943072zbMATH OpenFDO

Authors Themistoklis Melissourgos, Alexandros Hollender, John Fearnley, Argyrios Deligkas

Publication date 15 August 2025

Full work available at URL http://repository.essex.ac.uk/33602/1/Pure-Circuit%20-%20Strong%20Inapproximability%20for%20PPAD.pdf

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(5)

• Improved hardness results for the clearing problem in financial networks with credit default swaps
• Pure-circuit: tight inapproximability for PPAD
• Strong approximations and irrationality in financial networks with derivatives
• Clearing financial networks with derivatives: from intractability to algorithms
• On the computation of equilibria in discrete first-price auctions

This page was built for publication: Pure-circuit: strong inapproximability for PPAD

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943072)