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) …

Wherever there is group life, there has been a social division of labor and resource
allocation, since ancient times. Examples include ant colonies, bee colonies, and wolf …

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 introduce a new model for two-sided matching which allows us to borrow popular
fairness notions from the fair division literature such as envy-freeness up to one good and …

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 share …

The classical house allocation problem involves assigning n houses (or items) to n agents
according to their preferences. A key criterion in such problems is satisfying some fairness …

The classical house allocation problem involves assigning $ n $ houses (or items) to $ n $
agents according to their preferences. A key criterion in such problems is satisfying some …

We study the recently introduced cake-cutting setting in which the cake is represented by an
undirected graph. This generalizes the canonical interval cake and allows for modeling the …

Unsupervised feature selection (UFS) has attracted increasing attention because of the
difficulty and high cost of obtaining data labels. Since the ignorance of redundancy between …

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 …