Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/94656 
Year of Publication: 
2001
Series/Report no.: 
Claremont Colleges Working Papers in Economics No. 2001-03
Publisher: 
Claremont McKenna College, Department of Economics, Claremont, CA
Abstract: 
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 believe the portions are equally split. 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.
JEL: 
C61
D63
D74
Document Type: 
Working Paper

Files in This Item:
File
Size
189.36 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.