10 citations · 14 across the 2 of their papers we have counts for
4 papers
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…
Ordinal Maximin Share Approximation for Goods
Hadi Hosseini, Andrew Searns, Erel Segal-Halevi
In fair division of indivisible goods, -out-of- maximin share (MMS) is the value that an agent can guarantee by partitioning the goods into bundles and choosing the $\…
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…
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…