
Keep Your Distance: Land Division With Separation
This paper is part of an ongoing endeavor to bring the theory of fair di...
read it

Graphical Cake Cutting via Maximin Share
We study the recently introduced cakecutting setting in which the cake ...
read it

Mind the Gap: Cake Cutting With Separation
We study the problem of fairly allocating a divisible resource, also kno...
read it

Computing Fair Utilitarian Allocations of Indivisible Goods
We study the computational complexity of computing allocations that are ...
read it

On Fair Division under Heterogeneous Matroid Constraints
We study fair allocation of indivisible goods among additive agents with...
read it

How to Cut a Cake Fairly: A Generalization to Groups
A fundamental result in cake cutting states that for any number of playe...
read it

Generalized Rental Harmony
Rental Harmony is the problem of assigning rooms in a rented house to te...
read it

Quasilinear Rental Harmony
Rental Harmony is the problem of assigning rooms in a rented house to te...
read it

The Maximin Share Dominance Relation
Given a finite set X and an ordering ≽ over its subsets, the loutofd ...
read it

Fair Division with Bounded Sharing
A set of objects is to be divided fairly among agents with different tas...
read it

Strongly Budget Balanced Auctions for MultiSided Markets
In twosided markets, Myerson and Satterthwaite's impossibility theorem ...
read it

Fair Division with Minimal Sharing
A set of objects, some goods and some bads, is to be divided fairly amon...
read it

The Constrained Round Robin Algorithm for Fair and Efficient Allocation
We consider a multiagent resource allocation setting that models the as...
read it

Bipartite EnvyFree Matching
Bipartite EnvyFree Matching (BEFM) is a relaxation of perfect matching....
read it

Fair CakeCutting in Practice
Using a lab experiment, we investigate the reallife performance of envy...
read it

Making an Appraiser Work for You
In many situations, an uninformed agent (UA) needs to elicit information...
read it

CakeCutting with Different Entitlements: How Many Cuts are Needed?
A cake has to be divided fairly among n agents. When all agents have equ...
read it

How to Charge Lightning
Offchain transaction channels represent one of the leading techniques t...
read it

MUDA: A Truthful MultiUnit DoubleAuction Mechanism
In a seminal paper, McAfee (1992) presented a truthful mechanism for dou...
read it

Truthful Bilateral Trade is Impossible even with Fixed Prices
A seminal theorem of Myerson and Satterthwaite (1983) proves that, in a ...
read it

Democratic Fair Allocation of Indivisible Goods
We study the problem of fairly allocating indivisible goods to groups of...
read it

On Democratic Fairness for Groups of Agents
We study the problem of allocating indivisible goods to groups of intere...
read it
Erel SegalHalevi
is this you? claim profile