2 papers
cs.GT2024
Connected Equitable Cake Division via Sperner's Lemma
Umang Bhaskar, A. R. Sricharan, Rohit Vaish
We study the problem of fair cake-cutting where each agent receives a connected piece of the cake. A division of the cake is deemed fair if it is equitable, which means that all ag…
cs.GT2020
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
Umang Bhaskar, A. R. Sricharan, Rohit Vaish
We study the fair allocation of undesirable indivisible items, or chores. While the case of desirable indivisible items (or goods) is extensively studied, with many results known f…