34 citations · 429 across the 66 of their papers we have counts for
7 papers · 1 filter
Perpetually Fair Assignments Via Balanced Sequences of Permutations
Terrence Adams, Erel Segal-Halevi
There is a set of indivisible items (goods or chores), and a set of players. Each day, a single item should be assigned to each player. Assignments based on latin squares g…
On Connected Strongly-Proportional Cake-Cutting
Zsuzsanna Jankó, Attila Joó, Erel Segal-Halevi +1
We investigate the problem of fairly dividing a divisible heterogeneous resource, also known as a cake, among a set of agents who may have different entitlements. We characterize t…
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…
The Maximin Share Dominance Relation
Erel Segal-Halevi
Given a finite set and an ordering over its subsets, the -out-of- maximin-share of is the maximal (by ) subset of that can be constructed by pa…
Fair Multi-Cake Cutting
Erel Segal-Halevi
In the classic problem of fair cake-cutting, a single interval ("cake") has to be divided among n agents with different value measures, giving each agent a single sub-interval with…
Cake-Cutting with Different Entitlements: How Many Cuts are Needed?
Erel Segal-Halevi
A cake has to be divided fairly among agents. When all agents have equal entitlements, it is known that such a division can be implemented with cuts. When agents may have…
Fairly Dividing a Cake after Some Parts Were Burnt in the Oven
Erel Segal-Halevi
There is a heterogeneous resource that contains both good parts and bad parts, for example, a cake with some parts burnt, a land-estate with some parts heavily taxed, or a chore wi…