Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/94656 
Erscheinungsjahr: 
2001
Schriftenreihe/Nr.: 
Claremont Colleges Working Papers in Economics No. 2001-03
Verlag: 
Claremont McKenna College, Department of Economics, Claremont, CA
Zusammenfassung: 
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
Dokumentart: 
Working Paper

Datei(en):
Datei
Größe
189.36 kB





Publikationen in EconStor sind urheberrechtlich geschützt.