We study the fundamental problem of fairly allocating a set of indivisible goods among n
agents with additive valuations using the desirable fairness notion of maximin share (MMS) …

We consider the problem of guaranteeing maximin-share ($\MMS $) when allocating a set of
indivisible items to a set of agents with fractionally subadditive ($\XOS $) valuations. For …

We study fair distribution of a collection of m indivisible goods among a group of n agents,
using the widely recognized fairness principles of Maximin Share (MMS) and Any Price …

We are given a set of indivisible goods and a set of m agents where each good has a size
and each agent has an additive valuation function and a budget. The budgeted maximin …

Proportionality (PROP) is one of the simplest and most intuitive fairness criteria used for
allocating items among agents with additive utilities. However, when the items are …

We study the problem of fairly allocating either a set of indivisible goods or a set of mixed
divisible and indivisible goods (ie, mixed goods) to agents with additive utilities, taking the …

We study the problem of allocating $ m $ indivisible chores to $ n $ agents with additive cost
functions under the fairness notion of maximin share (MMS). In this work, we propose a …

In this paper, we consider the classic fair division problem of allocating $ m $ divisible items
to $ n $ agents with linear valuations over the items. We define novel notions of fair shares …

We investigate fairness in the allocation of indivisible items among groups of agents using
the notion of maximin share (MMS). While previous work has shown that no nontrivial …

In a general fair division model with transferable utilities we discuss endogenous lower and
upper guarantees on individual shares of benefits or costs. Like the more familiar …