Consensus-halving via theorems of Borsuk-Ulam and Tucker

Forest W. Simmons and Francis Edward Su

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 ; Manuscript version, February 2001
Authors:	Simmons, Forest W. ; Su, Francis Edward
Publisher:	Claremont, CA : Claremont Graduate University
Subject:	Mathematische Optimierung \| Mathematical programming \| Gerechtigkeit \| Justice \| Spieltheorie \| Game theory \| Theorie \| Theory

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (circa 9 Seiten)
Series:	Working paper series / Claremont Institute for Economic Policy Studies. - Claremont, Calif. : [Verlag nicht ermittelbar], ZDB-ID 2112948-4. - Vol. 2001, 03
Type of publication:	Book / Working Paper
Type of publication (narrower categories):	Graue Literatur ; Non-commercial literature ; Arbeitspapier ; Working Paper
Language:	English
Other identifiers:	hdl:10419/94656 [Handle]
Classification:	C61 - Optimization Techniques; Programming Models; Dynamic Analysis ; D63 - Equity, Justice, Inequality, and Other Normative Criteria and Measurement ; D74 - Conflict; Conflict Resolution; Alliances
Source:	ECONIS - Online Catalogue of the ZBW

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