Work

Pizza Sharing is PPA-hard

Year: 2025

Type: article

Abstract: We study the computational complexity of finding a solution for the straight-cut and square-cut pizza sharing problems. We show that computing an ε-approximate solution is PPA -complete for both problems, while finding an exact solution for the square-cut problem is FIXP -hard. Our PPA -hardness results apply for any ε < 1/5, even when all mass distributions consist of non-overlapping axis-aligned rectangles or when they are point sets, and our FIXP -hardness result applies even when all mass distributions are unions of squares and right-angled triangles. We also prove that the decision variants of both approximate problems are NP -complete, while the decision variant for the exact version of square-cut pizza sharing is \(\exists \mathbb {R} \) -complete.

Source: ACM Transactions on Computation Theory

DOI: 10.1145/3731249

Authors: Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos

Institutions: Royal Holloway University of London, University of Liverpool, University of Essex

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funder: Engineering and Physical Sciences Research Council

Awards: New Techniques for Resolving Boundary Problems in Total Search, NAfANE: New Approaches for Approximate Nash Equilibria