4 citations · 4 across the 1 of their papers we have counts for
3 papers
cs.GT2022★ 4 cited
Ordinal Maximin Share Approximation for Chores
Hadi Hosseini, Andrew Searns, Erel Segal-Halevi
We study the problem of fairly allocating a set of m indivisible chores (items with non-positive value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin…
cs.GT2021
Guaranteeing Maximin Shares: Some Agents Left Behind
Hadi Hosseini, Andrew Searns
The maximin share (MMS) guarantee is a desirable fairness notion for allocating indivisible goods. While MMS allocations do not always exist, several approximation techniques have…
cs.GT2020
Fair Division of Time: Multi-layered Cake Cutting
Hadi Hosseini, Ayumi Igarashi, Andrew Searns
We initiate the study of multi-layered cake cutting with the goal of fairly allocating multiple divisible resources (layers of a cake) among a set of agents. The key requirement is…