Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715): Difference between revisions

The authors show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of \(n\) people believes that the portions are equal. Moreover, the division takes at most \(n\) cuts, which is best possible. This extends prior work using methods from combinatorial topology to solve fair division problems. Several applications of consensus-halving are also discussed.