Arbeitspapier

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.

Language
Englisch

Bibliographic citation
Series: Claremont Colleges Working Papers in Economics ; No. 2001-03

Classification
Wirtschaft
Optimization Techniques; Programming Models; Dynamic Analysis
Equity, Justice, Inequality, and Other Normative Criteria and Measurement
Conflict; Conflict Resolution; Alliances; Revolutions

Event
Geistige Schöpfung
(who)
Simmons, Forest W.
Su, Francis
Event
Veröffentlichung
(who)
Claremont McKenna College, Department of Economics
(where)
Claremont, CA
(when)
2001

Handle
Last update
10.03.2025, 11:44 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Arbeitspapier

Associated

  • Simmons, Forest W.
  • Su, Francis
  • Claremont McKenna College, Department of Economics

Time of origin

  • 2001

Other Objects (12)