Showing 1–20 of 33 results
/ Date/ Name
Dec 2, 2023PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex OptimizationJul 14, 2020Consensus Halving for Sets of ItemsOct 13, 2023The Computational Complexity of Finding Stationary Points in Non-Convex OptimizationNov 22, 2023The Complexity of Computing KKT Solutions of Quadratic ProgramsDec 8, 2019The Classes PPA-$k$: Existence from Arguments Modulo $k$Feb 20, 2019The Hairy Ball Problem is PPAD-CompleteFeb 15, 2022Further Collapses in TFNPFeb 19, 2024On the Computation of Equilibria in Discrete First-Price AuctionsSep 11, 2025Discrepancy Beyond Additive Functions with Applications to Fair DivisionJun 11, 2020Optimally Deceiving a Learning Leader in Stackelberg GamesOct 10, 2024The Complexity of Symmetric Bimatrix Games with Common PayoffsNov 3, 2023Envy-Free Cake-Cutting for Four AgentsSep 11, 2024The Complexity of Two-Team Polymatrix Games with Independent AdversariesApr 30, 2026Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPADJan 24, 2023The Frontier of Intractability for EFX with Two AgentsOct 11, 2023Computing approximate roots of monotone functionsMar 26, 2020A Topological Characterization of Modulo-$p$ Arguments and Implications for Necklace SplittingMar 4, 2021On the Complexity of Equilibrium Computation in First-Price AuctionsNov 3, 2020The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLSMay 4, 2022Separations in Proof Complexity and TFNP