activity
20142026
most citedDemocratic Fair Allocation of Indivisible Goods

34 citations · 429 across the 66 of their papers we have counts for

collaborators
Showing 2016Show all

8 papers · 1 filter

math.PR2016

Concentration Inequalities for Random Sets

Erel Segal-Halevi, Avinatan Hassidim

In a large, possibly infinite population, each subject is colored red with probability , independently of the others. Then, a finite sub-population is selected, possibly as a fu…

cs.GT2016★ 13 cited

Envy-Free Division of Land

Erel Segal-Halevi, Shmuel Nitzan, Avinatan Hassidim +1

Classic cake-cutting algorithms enable people with different preferences to divide among them a heterogeneous resource (``cake''), such that the resulting division is fair accordin…

cs.GT2016★ 29 cited

SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism

Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann

In a seminal paper, McAfee (1992) presented the first dominant strategy truthful mechanism for double auction. His mechanism attains nearly optimal gain-from-trade when the market…

cs.GT2016★ 1 cited

Demand-Flow of Agents with Gross-Substitute Valuations

Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann

We consider the class of valuations on indivisible items called gross-substitute (GS). This class was introduced by Kelso and Crawford (1982) and is widely used in studies of marke…

cs.GT2016★ 5 cited

Envy-Free Cake-Cutting among Families

Erel Segal-Halevi, Shmuel Nitzan

This paper extends the classic cake-cutting problem to a situation in which the "cake" is divided among families. Each piece of cake is owned and used simultaneously by all members…

cs.GT2016

Double Auctions in Markets for Multiple Kinds of Goods

Erel Segal-Halevi, Avinatan Hassidim, Yonatan Aumann

Motivated by applications such as stock exchanges and spectrum auctions, there is a growing interest in mechanisms for arranging trade in two-sided markets. Existing mechanisms are…

cs.CG2016★ 1 cited

Counting Blanks in Polygonal Arrangements

Arseniy Akopyan, Erel Segal-Halevi

Inside a two dimensional region ("cake"), there are non-overlapping tiles of a certain kind ("toppings"). We want to expand the toppings while keeping them non-overlapping, and…

cs.GT2016★ 12 cited

Redividing the Cake

Erel Segal-Halevi

The paper considers fair allocation of resources that are already allocated in an unfair way. This setting requires a careful balance between the fairness considerations and the ri…