2 citations · 4 across the 12 of their papers we have counts for
4 papers · 1 filter
A Discrete and Bounded Locally Envy-Free Cake Cutting Protocol on Trees
Ganesh Ghalme, Xin Huang, Yuka Machino +1
We study the classic problem of \emph{fairly} dividing a heterogeneous and divisible resource -- modeled as a line segment and typically called as a \emph{cake} -- among $n…
New Fairness Concepts for Allocating Indivisible Items
Ioannis Caragiannis, Jugal Garg, Nidhi Rathi +2
For the fundamental problem of fairly dividing a set of indivisible items among agents, envy-freeness up to any item (EFX) and maximin fairness (MMS) are arguably the most compelli…
Envy-Free Cake Cutting with Graph Constraints
Ganesh Ghalme, Xin Huang, Nidhi Rathi
We study the classic problem of fairly dividing a heterogeneous and divisible resource -- represented by a cake, -- among agents. This work considers an interesting var…
Optimizing over Serial Dictatorships
Ioannis Caragiannis, Nidhi Rathi
Motivated by the success of the serial dictatorship mechanism in social choice settings, we explore its usefulness in tackling various combinatorial optimization problems. We do so…