We prove that the associated computational problem of (a) computing an approximate zero is PPAD-complete, and (b) computing an exact zero is FIXP-hard. We also consider the Hairy Ball Theorem on toroidal instead of spherical domains and show that the approximate problem remains PPAD-complete....
We also show that fractional stable paths problem and finding strong fractional kernels in digraphs are PPAD-hard.doi:http://dx.doi.org/Shiva Kintalicomputer scienceS. Kintali. Scarf is PPAD-complete. CoRR, abs/0812.1601, 2008.S. Kintali. Scarf is ppad-complete. 2008....
We initiate the study of the relationship between two complexity classes, BQP (Bounded-Error Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument, Directed). We first give a conjecture that PPAD is contained in BQP, and show a necessary and sufficient condition for the conjecture to ...
2d-tucker is ppad-complete. In 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009. Proceedings, pages 569-574. Springer-Verlag, 2009.Palvolgyi D (2009) 2D-Tucker is PPAD-complete. Leonardi S, ed. Proc. 5th Internat. Workshop Internet Network Econom. (Springer, ...
2009. 2d-tucker is ppad-complete. In Internet and Network Economics, S. Leonardi, Ed. Lecture Notes in Computer Science Series, vol. 5929. Springer Berlin Heidelberg, 569-574.Domotor Palvolgyi. 2009. 2D-TUCKER is PPAD-complete. In Internet and Network Economics. Lecture Notes in Computer ...
Here we provide the first hardness result for the corresponding computational problem, showing that even for a simple class of Lipschitz games (Lipschitz polymatrix games), finding pure \\epsilon \\epsilon -approximate equilibria is PPAD-complete, for suitable pairs of values (\\epsilon(n), \\...