34 citations · 429 across the 66 of their papers we have counts for
5 papers · 1 filter
Mind the Gap: Cake Cutting With Separation
Edith Elkind, Erel Segal-Halevi, Warut Suksompong
We study the problem of fairly allocating a divisible resource, also known as cake cutting, with an additional requirement that the shares that different agents receive should be s…
Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
Haris Aziz, Xin Huang, Nicholas Mattei +1
We analyze the run-time complexity of computing allocations that are both fair and maximize the utilitarian social welfare, defined as the sum of agents' utilities. We focus on two…
Fractionally balanced hypergraphs and rainbow KKM theorems
Ron Aharoni, Eli Berger, Joseph Briggs +2
A d-partite hypergraph is called *fractionally balanced* if there exists a non-negative, not identically zero, function on its edge set that has constant degrees in each vertex sid…
On Fair Division under Heterogeneous Matroid Constraints
Amitay Dror, Michal Feldman, Erel Segal-Halevi
We study fair allocation of indivisible goods among additive agents with feasibility constraints. In these settings, every agent is restricted to get a bundle among a specified set…
How to Cut a Cake Fairly: A Generalization to Groups
Erel Segal-Halevi, Warut Suksompong
A fundamental result in cake cutting states that for any number of players with arbitrary preferences over a cake, there exists a division of the cake such that every player receiv…