Related papers: Fair division and generalizations of Sperner- and …
We study the problem of fair cake-cutting where each agent receives a connected piece of the cake. A division of the cake is deemed fair if it is equitable, which means that all agents derive the same value from their assigned piece. Prior…
We prove a common generalization to several mass partition results using hyperplane arrangements to split $\mathbb{R}^d$ into two sets. Our main result implies the ham-sandwich theorem, the necklace splitting theorem for two thieves, a…
Recently Sober\'on proved a far-reaching generalization of the colorful KKM Theorem due to Gale: let $n\geq k$, and assume that a family of closed sets $(A^i_j\mid i\in [n], j\in [k])$ has the property that for every $I\in…
A necklace splitting theorem of Goldberg and West asserts that any k-colored (continuous) necklace can be fairly split using at most k cuts. Motivated by the problem of Erd\H{o}s on strongly nonrepetitive sequences, Alon et al. proved that…
We prove several versions of N. Alon's "necklace-splitting theorem", subject to additional constraints, as illustrated by the following results. (1) The "almost equicardinal necklace-splitting theorem" claims that, without increasing the…
The well-known "necklace splitting theorem" of Alon asserts that every $k$-colored necklace can be fairly split into $q$ parts using at most $t$ cuts, provided $k(q-1)\leq t$. In a joint paper with Alon et al. we studied a kind of opposite…
We derive some consequences of the Liouville theorem for plurisubharmonic functions of L.-F. Tam and the author. The first result provides a nonlinear version of the complex splitting theorem (which splits off a factor of $\mathbb{C}$…
The well-known "splitting necklace theorem" of Noga Alon says that each "necklace" having beads of n different colors can be fairly divided between k "thieves" by at most n(k-1) cuts. We demonstrate that Alon's result is a special case of a…
We prove a splitting theorem for Riemannian n-manifolds with scalar curvature bounded below by a negative constant and containing certain area-minimising hypersurfaces (Theorem 3). Thus we generalise [25,Theorem 3] by Nunes. This splitting…
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the…
We prove a common generalization of the Ham Sandwich theorem and Alon's Necklace Splitting theorem. Our main results show the existence of fair distributions of $m$ measures in $R^d$ among $r$ thieves using roughly $mr/d$ convex pieces,…
We introduce a generalized cake-cutting problem in which we seek to divide multiple cakes so that two players may get their most-preferred piece selections: a choice of one piece from each cake, allowing for the possibility of linked…
We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…
We study nested partitions of $R^d$ obtained by successive cuts using hyperplanes with fixed directions. We establish the number of measures that can be split evenly simultaneously by taking a partition of this kind and then distributing…
The complexity classes PPA-$k$, $k \geq 2$, have recently emerged as the main candidates for capturing the complexity of important problems in fair division, in particular Alon's Necklace-Splitting problem with $k$ thieves. Indeed, the…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
This paper studies fair division of divisible and indivisible items among agents whose cardinal preferences are not necessarily monotone. We establish the existence of fair divisions and develop approximation algorithms to compute them. We…
In this article we study the problem of fair division. In particular we study a notion introduced by J. Barbanel that generalizes super envy-free fair division. We give a new proof of his result. Our approach allows us to give an explicit…
This work develops algorithmic results for the classic cake-cutting problem in which a divisible, heterogeneous resource (modeled as a cake) needs to be partitioned among agents with distinct preferences. We focus on a standard formulation…
Fair division with unequal shares is an intensively studied recourse allocation problem. For $ i\in [n] $, let $ \mu_i $ be an atomless probability measure on the measurable space $(C,\mathcal{S}) $ and let $ t_i $ be positive numbers…