Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem

Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh

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…