Splitting necklaces
From MaRDI portal
Publication:1097280
DOI10.1016/0001-8708(87)90055-7zbMath0635.05008OpenAlexW4206085806MaRDI QIDQ1097280
Publication date: 1987
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(87)90055-7
Exact enumeration problems, generating functions (05A15) Classical topics in algebraic topology (55M99)
Related Items
A nonlinear Lazarev–Lieb theorem: L2-orthogonality via motion planning, Consensus-Halving: Does It Ever Get Easier?, Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem, Measure partitions using hyperplanes with fixed directions, Polytopal complexes: maps, chain complexes and… necklaces, The Borsuk-Ulam Theorem and Bisection of Necklaces, Approximating fair division with a limited number of cuts, Topology and combinatorics of partitions of masses by hyperplanes, A survey of mass partitions, Almost envy-freeness for groups: improved bounds via discrepancy theory, Discrete geometry on colored point sets in the plane -- a survey, Fair splitting of colored paths, A probabilistic spatial distribution model for wire faults in parallel network-on-chip links, Dynamic Fair Resource Division, Existence of a simple and equitable fair division: a short proof, On the computability of equitable divisions, Obstacles for splitting multidimensional necklaces, Stiefel manifolds and coloring the pentagon, Envy-free division via configuration spaces, Colorful Matchings, Approximately EFX allocations for indivisible chores, Splitting multidimensional necklaces, Unnamed Item, Fair Representation by Independent Sets, Thieves can make sandwiches, Fair Division and Generalizations of Sperner- and KKM-type Results, Unnamed Item, On the Lazarev-Lieb extension of the Hobby-Rice theorem, Simplotopal maps and necklace splitting, On a method of obtaining exact fair divisions, Computing exact solutions of consensus halving and the Borsuk-Ulam theorem, Convex equipartitions: the spicy chicken theorem, Illumination complexes, \(\varDelta\)-zonotopes, and the polyhedral curtain theorem, Fairly allocating contiguous blocks of indivisible items, Vanishing of all equivariant obstructions and the mapping degree, Resource-monotonicity and population-monotonicity in connected cake-cutting, The classes PPA-\(k\): existence from arguments modulo \(k\), Fair division of mixed divisible and indivisible goods, Extensions of cut-and-choose fair division, On existence theorems, The classes PPA-\(k\): existence from arguments modulo \(k\), Computing solutions of the paintshop-necklace problem, Equipartitions of measures in $\mathbb{R}^4$, The Chromatic Number of Kneser Hypergraphs, The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics, Witt vectors. Part 1, Unnamed Item, Democratic fair allocation of indivisible goods, SPLITTING LOOPS AND NECKLACES: VARIANTS OF THE SQUARE PEG PROBLEM, Note on a conjecture of Sierksma, Fair cake-cutting among families, Splitting necklaces and measurable colorings of the real line, Dold's theorem from viewpoint of strong compatibility graphs, Consensus-halving via theorems of Borsuk-Ulam and Tucker, 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, Splitting Necklaces, with Constraints, Shorter Labeling Schemes for Planar Graphs, Two's company, three's a crowd: consensus-halving for a constant number of agents, The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich, Fair Cake Division Under Monotone Likelihood Ratios, Consensus Halving for Sets of Items
Cites Work
