research
∙
07/24/2023
On the complexity of Pareto-optimal and envy-free lotteries
We study the classic problem of dividing a collection of indivisible res...
share
research
∙
02/06/2023
Optimally Interpolating between Ex-Ante Fairness and Welfare
For the fundamental problem of allocating a set of resources among indiv...
research
∙
11/04/2022
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees
We study the classic problem of fairly dividing a heterogeneous and divi...
research
∙
05/25/2022
Envy-Free Cake Cutting with Graph Constraints
We study the classic problem of fairly dividing a heterogeneous and divi...
research
∙
02/14/2022
Optimizing over Serial Dictatorships
Motivated by the success of the serial dictatorship mechanism in social ...
research
∙
05/31/2020
Fair Cake Division Under Monotone Likelihood Ratios
This work develops algorithmic results for the classic cake-cutting prob...
research
∙
07/25/2019
Fair and Efficient Cake Division with Connected Pieces
The classic cake-cutting problem provides a model for addressing fair an...
research
∙
11/27/2018
Fair Division with a Secretive Agent
We study classic fair-division problems in a partial information setting...
research
∙
07/11/2018