Consensus-halving via theorems of Borsuk-Ulam and Tucker
From MaRDI portal
Publication:1810715
DOI10.1016/S0165-4896(02)00087-2zbMath1027.91047WikidataQ56039178 ScholiaQ56039178MaRDI QIDQ1810715
Forest W. Simmons, Francis Edward Su
Publication date: 9 June 2003
Published in: Mathematical Social Sciences (Search for Journal in Brave)
(n)-person games, (n>2) (91A06) Fixed points and coincidences in algebraic topology (55M20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (29)
Cutting a Cake Fairly for Groups Revisited ⋮ Consensus-Halving: Does It Ever Get Easier? ⋮ Almost envy-freeness for groups: improved bounds via discrepancy theory ⋮ Existence of a simple and equitable fair division: a short proof ⋮ On the computability of equitable divisions ⋮ Fixed-Parameter Algorithms for the Kneser and Schrijver Problems ⋮ Unnamed Item ⋮ Proving Tucker’s Lemma with a volume argument ⋮ Computing exact solutions of consensus halving and the Borsuk-Ulam theorem ⋮ Resource-monotonicity and population-monotonicity in connected cake-cutting ⋮ A combinatorial analog of a theorem of F.J. Dyson ⋮ Two-player envy-free multi-cake division ⋮ The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics ⋮ A user's guide to the topological Tverberg conjecture ⋮ Envy-free cake division without assuming the players prefer nonempty pieces ⋮ Approximating the existential theory of the reals ⋮ Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem ⋮ Paintshop, odd cycles and necklace splitting ⋮ Multilabeled Versions of Sperner's and Fan's Lemmas and Applications ⋮ Computing a small agreeable set of indivisible items ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ A constructive proof of Ky Fan's generalization of Tucker's lemma ⋮ The complexity of finding fair independent sets in cycles ⋮ Two's company, three's a crowd: consensus-halving for a constant number of agents ⋮ Discrete versions of the KKM lemma and their PPAD-completeness ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich ⋮ Consensus Halving for Sets of Items ⋮ A polytopal generalization of Sperner's lemma ⋮ A near equitable 2-person cake cutting algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Splitting necklaces
- A constructive proof of Tucker's combinatorial lemma
- The computation of fixed points and applications
- Generalized Kneser coloring theorems with combinatorial proofs
- Super envy-free cake division and independence of measures
- Bidding for envy-freeness: a procedural approach to \(n\)-player fair-division problems
- Rental Harmony: Sperner's Lemma in Fair Division
- Bisection of Circle Colorings
- On a Topological Generalization of a Theorem of Tverberg
- A moving-knife solution to the four-person envy-free cake-division problem
- Four-Person Envy-Free Chore Division
- The Borsuk-Ulam Theorem and Bisection of Necklaces
This page was built for publication: Consensus-halving via theorems of Borsuk-Ulam and Tucker
