Constant inapproximability for PPA

DOI10.1137/22M1536613MaRDI QIDQ7020224zbMATH OpenFDO

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

Publication date 4 March 2025

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/22M1536613

zbMATH Keywords

consensus halvingfair divisionham-sandwich theoremPPATFNP

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• 2-D Tucker is PPA complete
• A Moment Problem in L 1 Approximation
• Approximating the existential theory of the reals
• Bisecting measures with hyperplane arrangements
• Bisection of Circle Colorings
• Computing exact solutions of consensus halving and the Borsuk-Ulam theorem
• Consensus Halving for Sets of Items
• Consensus halving is PPA-complete
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• Consensus-Halving: Does It Ever Get Easier?
• Fair representation by independent sets
• Fair splitting of colored paths
• Fair splittings by independent sets in sparse graphs
• Hardness results for consensus-halving
• scientific article; zbMATH DE number 3102257 (Why is no real title available?)
• scientific article; zbMATH DE number 7662165 (Why is no real title available?)
• scientific article; zbMATH DE number 7788493 (Why is no real title available?)
• Inapproximability of Nash equilibrium
• Measure partitions using hyperplanes with fixed directions
• On the Complexity of Nash Equilibria and Other Fixed Points
• On the complexity of the parity argument and other inefficient proofs of existence
• On total functions, existence theorems and computational complexity
• Pure-circuit: tight inapproximability for PPAD
• Settling the complexity of computing two-player Nash equilibria
• Splitting necklaces
• The Borsuk-Ulam Theorem and Bisection of Necklaces
• The classes PPA-\(k\): existence from arguments modulo \(k\)
• The complexity of computing a Nash equilibrium
• The complexity of finding fair independent sets in cycles
• The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
• The complexity of splitting necklaces and bisecting ham sandwiches
• Two's company, three's a crowd: consensus-halving for a constant number of agents

Cited in

(1)

• Pizza sharing is PPA-hard

This page was built for publication: Constant inapproximability for PPA

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