Consenus-Halving: Does it Ever Get Easier?

by   Aris Filos-Ratsikas, et al.

In the ε-Consensus-Halving problem, a fundamental problem in fair division, there are n agents with valuations over the interval [0,1], and the goal is to divide the interval into pieces and assign a label "+" or "-" to each piece, such that every agent values the total amount of "+" and the total amount of "-" almost equally. The problem was recently proven by Filos-Ratsikas and Goldberg [2019] to be the first "natural" complete problem for the computational class PPA, answering a decade-old open question. In this paper, we examine the extent to which the problem becomes easy to solve, if one restricts the class of valuation functions. To this end, we provide the following contributions. First, we obtain a strengthening of the PPA-hardness result of [Filos-Ratsikas and Goldberg 2019], to the case when agents have piecewise uniform valuations with only two blocks. We obtain this result via a new reduction, which is in fact conceptually much simpler than the corresponding one in [Filos-Ratsikas and Goldberg 2019]. Then, we consider the case of single-block (uniform) valuations and provide a parameterized polynomial time algorithm for solving ε-Consensus-Halving for any ε, as well as a polynomial-time algorithm for ε=1/2; these are the first algorithmic results for the problem. Finally, an important application of our new techniques is the first hardness result for a generalization of Consensus-Halving, the Consensus-1/k-Division problem. In particular, we prove that ε-Consensus-1/3-Division is PPAD-hard.


Consensus-Halving: Does it Ever Get Easier?

In the ε-Consensus-Halving problem, a fundamental problem in fair divisi...

Consensus Halving for Sets of Items

Consensus halving refers to the problem of dividing a resource into two ...

Constant Inapproximability for PPA

In the ε-Consensus-Halving problem, we are given n probability measures ...

Consensus Halving is PPA-Complete

We show that the computational problem CONSENSUS-HALVING is PPA-complete...

The Bike Sharing Problem

Assume that m ≥ 1 autonomous mobile agents and 0 ≤ b ≤ m single-agent tr...

Dividing Bads is Harder than Dividing Goods: On the Complexity of Fair and Efficient Division of Chores

We study the chore division problem where a set of agents needs to divid...

Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem

In the consensus halving problem we are given n agents with valuations o...