Consensus-Halving: Does It Ever Get Easier?

@article{FilosRatsikas2020ConsensusHalvingDI,
  title={Consensus-Halving: Does It Ever Get Easier?},
  author={Aris Filos-Ratsikas and Alexandros Hollender and Katerina Sotiraki and Manolis Zampetakis},
  journal={Proceedings of the 21st ACM Conference on Economics and Computation},
  year={2020}
}
In the ε-Consensus-Halvingproblem, 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[18,19] to be the first "natural" complete problem for the computational class PPA, answering a decade-old… 

Figures from this paper

Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
TLDR
This work considers the ε-Consensus-Halving problem, in which a set of heterogeneous agents aim at dividing a continuous resource into two portions that all of them simultaneously consider to be of approximately the same value, and shows that the problem is PPA-complete and admits exponential query complexity lower bounds, even for two agents.
Consensus Halving for Sets of Items
TLDR
This paper presents a polynomial-time algorithm that computes a consensus halving with at most $n$ cuts, and shows that $ n$ cuts are almost surely necessary when the agents' utilities are drawn from probabilistic distributions.
Square-Cut Pizza Sharing is PPA-complete
TLDR
The computational complexity of computing solutions for the square-cut pizza sharing problem is studied, and it is shown that finding an approximate solution to this problem is PPA-complete, while finding an exact solution is FIXP-hard and in BU.
Efficient Splitting of Measures and Necklaces
TLDR
Lower bounds are established for the number of cuts required in the online model for both problems even for $k=2$ agents, showing that the numberof cuts in theOnline algorithm is optimal up to a logarithmic factor.
Computational Complexity of the α-Ham-Sandwich Problem
TLDR
It is shown that for the α-Ham-Sandwich theorem, the search problem of finding the dividing hyperplane lies in UEOPL, the first non-trivial containment of the problem in a complexity class and places it in the company of several classic search problems.
A Topological Characterization of Modulo-p Arguments and Implications for Necklace Splitting
TLDR
The first topological characterization of the classes PPA-$p is provided, which shows that the computational problem associated with a simple generalization of Tucker's Lemma, termed $p-polygon-Tucker, as well as the associated Borsuk-Ulam-type theorem, $p$- polygon-Borsuk -Ulam, are PPA-p-complete.
The complexity of constrained min-max optimization
TLDR
This result is the first to show an exponential separation between these two fundamental optimization problems in the oracle model, and comes in sharp contrast to minimization problems, where finding approximate local minima in the same setting can be done with Projected Gradient Descent using O(L/ε) many queries.
The Complexity of Finding Fair Independent Sets in Cycles
TLDR
The problem of finding a monochromatic edge in a Schrijver graph, given a succinct representation of a coloring that uses fewer colors than its chromatic number, is $\mathsf{PPA}$-complete as well.
Constant inapproximability for PPA
In the ε-Consensus-Halving problem, we are given n probability measures v1, …, vn on the interval R = [0,1], and the goal is to partition R into two parts R+ and R− using at most n cuts, so that
Fair Division Algorithms for Electricity Distribution
In many developing countries, the total electricity demand is larger than the limited generation capacity of power stations. Many countries adopt the common practice of routine load shedding —
...
...

References

SHOWING 1-10 OF 65 REFERENCES
Hardness Results for Consensus-Halving
TLDR
It is proved that computing $\epsilon$-approximate consensus-halving solution using $n-1$ cuts is in PPA, and is PPAD-hard, where $\ep silon$ is some positive constant; the problem remains PP AD-hard when the authors allow a constant number of additional cuts.
Two's Company, Three's a Crowd: Consensus-Halving for a Constant Number of Agents
TLDR
This work considers the ε-Consensus-Halving problem, in which a set of heterogeneous agents aim at dividing a continuous resource into two portions that all of them simultaneously consider to be of approximately the same value, and shows that the problem is PPA-complete and admits exponential query complexity lower bounds, even for two agents.
Algorithmic Solutions for Envy-Free Cake Cutting
TLDR
It is shown that the envy-free cake-cutting problem has the same complexity as finding a Brouwer's fixed point, or, more formally, it is PPAD-complete.
A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number of Agents
  • H. Aziz, Simon Mackenzie
  • Mathematics, Computer Science
    2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
TLDR
This work considers the well-studied cake cutting problem and proposes a discrete and bounded envy-free protocol for any number of agents that can find in at most nn+1 queries an envy- free partial allocation of the cake.
Settling the complexity of computing two-player Nash equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by
On the Complexity of Nash Equilibria and Other Fixed Points
TLDR
It is shown that the (exact or approximate) computation of Nash equilibria for 3 or more players is complete for FIXP, which captures search problems that can be cast as fixed point computation problems for functions represented by algebraic circuits (straight line programs) over basis with rational constants.
A discrete and bounded envy-free cake cutting protocol for four agents
TLDR
This work considers the well-studied cake cutting problem in which the goal is to identify an envy-free allocation based on a minimal number of queries from the agents and proposes a discrete and bounded envy- free protocol for four agents.
Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm
TLDR
It is proved that the problem of computing an equilibrium is PPAD-complete, where PPAD stands for Polynomial Parity Arguments on Directed Graphs, and complementary pivot algorithms based on a suitable adaptation of Lemke’s classic algorithm are obtained.
Splitting Necklaces
Let N be an opened necklace with ha, beads of color i, 1 < i $ t. We show that it is possible to cut N in (k - 1). t places and partition the resulting intervals into k collections, each containing
A moment problem in L1 approximation
  • Proceedings of the American Mathematical Society,
  • 1965
...
...