Document Type

Article - preprint


Mathematics (HMC)

Publication Date



In this paper we 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 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 discussed.


Author's pre-print manuscript available for download.

For the publisher's version, please visit

Rights Information

© 2003 Elsevier

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.