Fair Division and Generalizations of Sperner- and KKM-type Results
DOI10.1137/17M1116210zbMath1385.54013arXiv1701.04955WikidataQ130168570 ScholiaQ130168570MaRDI QIDQ4604649
Florian Frick, Zoe Wellner, Vivek Pisharody, Megumi Asada, Maxwell Polevy, David Stoner, Ling Hei Tsang
Publication date: 5 March 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04955
KKM theoremSperner's lemmafair divisioncake cuttingnecklace splittingcombinatorial fixed point theorem
Fixed-point and coincidence theorems (topological aspects) (54H25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (15)
Cites Work
- Unnamed Item
- Hyperplane mass partitions via relative equivariant obstruction theory
- Rigidity and the lower bound theorem. I
- Equilibrium in a discrete exchange economy with money
- Topology and combinatorics of partitions of masses by hyperplanes
- Sperner labellings: A combinatorial approach
- Non-partitionable point sets
- Splitting necklaces
- A constructive proof of a permutation-based generalization of Sperner's lemma
- A generalization of Caratheodory's theorem
- Lower-bound theorems for pseudomanifolds
- Complexity results on a paint shop problem.
- KKM type theorems with boundary conditions
- A polytopal generalization of Sperner's lemma
- Equipartition of mass distributions by hyperplanes
- Extensions of Sperner and Tucker's lemma for manifolds
- Splitting multidimensional necklaces
- Simultane Vierteilung zweier Körper
- A proof of the lower bound conjecture for convex polytopes
- Measure partitions using hyperplanes with fixed directions
- Rental Harmony: Sperner's Lemma in Fair Division
- Algorithmic construction of sets for k -restrictions
- Discrete Splittings of the Necklace
- Bisection of Circle Colorings
- Topology of the Grünbaum–Hadwiger–Ramos hyperplane mass partition problem
- Thieves can make sandwiches
- The Borsuk-Ulam Theorem and Bisection of Necklaces
- A discrete and bounded envy-free cake cutting protocol for four agents
- Sperner's Colorings, Hypergraph Labeling Problems and Fair Division
- On the facial structure of convex polytopes
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
This page was built for publication: Fair Division and Generalizations of Sperner- and KKM-type Results