Log In Sign Up

Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem

by   Eleni Batziou, et al.

In the consensus halving problem we are given n agents with valuations over the interval [0,1]. The goal is to divide the interval into at most n+1 pieces (by placing at most n cuts), which may be combined to give a partition of [0,1] into two sets valued equally by all agents. The existence of a solution may be established by the Borsuk-Ulam theorem. We consider the task of computing an approximation of an exact solution of the consensus halving problem, where the valuations are given by distribution functions computed by algebraic circuits. Here approximation refers to computing a point that ε-close to an exact solution, also called strong approximation. We show that this task is polynomial time equivalent to computing an approximation to an exact solution of the Borsuk-Ulam search problem defined by a continuous function that is computed by an algebraic circuit. The Borsuk-Ulam search problem is the defining problem of the complexity class BU. We introduce a new complexity class BBU to also capture an alternative formulation of the Borsuk-Ulam theorem from a computational point of view. We investigate their relationship and prove several structural results for these classes as well as for the complexity class FIXP.


page 1

page 2

page 3

page 4


Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

We study the problem of finding an exact solution to the consensus halvi...

Consensus Halving for Sets of Items

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

Consensus-Halving: Does it Ever Get Easier?

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

A Universality Theorem for Nested Polytopes

In a nutshell, we show that polynomials and nested polytopes are topolog...

Consenus-Halving: Does it Ever Get Easier?

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

AND Testing and Robust Judgement Aggregation

A function f{0,1}^n→{0,1} is called an approximate AND-homomorphism if c...

The strong approximation theorem and computing with linear groups

We obtain a computational realization of the strong approximation theore...