3 papers
cs.GT2022
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…
cs.GT2018
Fair Division with a Secretive Agent
Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
We study classic fair-division problems in a partial information setting. This paper respectively addresses fair division of rent, cake, and indivisible goods among agents with car…
cs.GT2018
Fully Polynomial-Time Approximation Schemes for Fair Rent Division
Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi
We study the problem of fair rent division that entails splitting the rent and allocating the rooms of an apartment among roommates (agents) in a fair manner. In this setup, a dist…