34 citations · 429 across the 66 of their papers we have counts for
5 papers · 1 filter
Weighted Fairness Notions for Indivisible Items Revisited
Mithun Chakraborty, Erel Segal-Halevi, Warut Suksompong
We revisit the setting of fairly allocating indivisible items when agents have different weights representing their entitlements. First, we propose a parameterized family of relaxa…
On Monotonicity of Number-Partitioning Algorithms
Erel Segal-Halevi
An algorithm for number-partitioning is called value-monotone if whenever one of the input numbers increases, the objective function (the largest sum or the smallest sum of a subse…
Ordinal Maximin Share Approximation for Goods
Hadi Hosseini, Andrew Searns, Erel Segal-Halevi
In fair division of indivisible goods, -out-of- maximin share (MMS) is the value that an agent can guarantee by partitioning the goods into bundles and choosing the $\…
Graphical Cake Cutting via Maximin Share
Edith Elkind, Erel Segal-Halevi, Warut Suksompong
We study the recently introduced cake-cutting setting in which the cake is represented by an undirected graph. This generalizes the canonical interval cake and allows for modeling…
Keep Your Distance: Land Division With Separation
Edith Elkind, Erel Segal-Halevi, Warut Suksompong
This paper is part of an ongoing endeavor to bring the theory of fair division closer to practice by handling requirements from real-life applications. We focus on two requirements…