34 citations · 429 across the 66 of their papers we have counts for
8 papers · 1 filter
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…
Strongly Budget Balanced Auctions for Multi-Sided Markets
Rica Gonen, Erel Segal-Halevi
In two-sided markets, Myerson and Satterthwaite's impossibility theorem states that one can not maximize the gain-from-trade while also satisfying truthfulness, individual-rational…
Generalized Rental Harmony
Erel Segal-Halevi
Rental Harmony is the problem of assigning rooms in a rented house to tenants with different preferences, and simultaneously splitting the rent among them, such that no tenant envi…
Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
Samuel Bismuth, Ivan Bliznets, Erel Segal-Halevi
A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the…
Obvious Manipulations in Cake-Cutting
Josue Ortega, Erel Segal-Halevi
In cake-cutting, strategy-proofness is a very costly requirement in terms of fairness: for n=2 it implies a dictatorial allocation, whereas for n > 2 it requires that one agent rec…
Efficient Fair Division with Minimal Sharing
Fedor Sandomirskiy, Erel Segal-Halevi
A collection of objects, some of which are good and some are bad, is to be divided fairly among agents with different tastes, modeled by additive utility functions. If the objects…
The Constrained Round Robin Algorithm for Fair and Efficient Allocation
Haris Aziz, Xin Huang, Nicholas Mattei +1
We consider a multi-agent resource allocation setting that models the assignment of papers to reviewers. A recurring issue in allocation problems is the compatibility of welfare/ef…
Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division
Elad Aigner-Horev, Erel Segal-Halevi
A matching in a bipartite graph with parts X and Y is called envy-free if no unmatched vertex in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but…