Consensus-halving via Theorems of Borsuk-Ulam and Tucker

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.

MoreLess

Year of publication:	2001
Authors:	Simmons, Forest W. ; Su, Francis
Publisher:	Claremont, CA : Claremont McKenna College, Department of Economics

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Series:	Claremont Colleges Working Papers in Economics ; 2001-03
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Working Paper
Language:	English
Other identifiers:	874226384 [GVK] hdl:10419/94656 [Handle] RePEc:clm:clmeco:2001-03 [RePEc]
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; D63 - Equity, Justice, Inequality, and Other Normative Criteria and Measurement ; D74 - Conflict; Conflict Resolution; Alliances
Source:	EconStor

Persistent link: https://www.econbiz.de/10010334625