The existence of envy-freeness up to any good (EFX) allocations is a fundamental open
problem in discrete fair division. The goal is to determine the existence of an allocation of a …

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 fair allocation of indivisible goods to n agents with no transfers.
When agents have equal entitlements, the well-established notion of the maximin share …

We consider fair division of a set of indivisible goods among $ n $ agents with additive
valuations using the fairness notion of maximin share (MMS). MMS is the most popular …

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 consider fair allocation of indivisible goods to n equally entitled agents. Every agent i
has a valuation function vi from some given class of valuation functions. A share s is a …

The classic fair division problems assume the resources to be allocated are either divisible
or indivisible, or contain a mixture of both, but the agents always have a predetermined and …

We study the problem of computing\emph {fair} divisions of a set of indivisible goods among
agents with\emph {additive} valuations. For the past many decades, the literature has …

We consider the problem of fairly allocating a sequence of indivisible items that arrive online
in an arbitrary order to a group of $ n $ agents with additive normalized valuation functions …

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 …