Consensus-halving via theorems of Borsuk-Ulam and Tucker (Q1810715): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56039178, #quickstatements; #temporary_batch_1707252663060 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:46, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Consensus-halving via theorems of Borsuk-Ulam and Tucker |
scientific article |
Statements
Consensus-halving via theorems of Borsuk-Ulam and Tucker (English)
0 references
9 June 2003
0 references
The authors 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 believes that the portions are equal. 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 also discussed.
0 references
fair division
0 references
Borsuk-Ulam theorem
0 references
Tucker's lemma
0 references
consensus-halving
0 references
