We study the allocation of indivisible goods that form an undirected graph and quantify the
loss of fairness when we impose a constraint that each agent must receive a connected …

Finding an envy-free allocation of indivisible resources to agents is a central task in many
multiagent systems. Often, non-trivial envy-free allocations do not exist and determining …

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 …

A matching in a bipartite graph with parts X and Y is called envy-free, if no unmatched vertex
in X is a adjacent to a matched vertex in Y. Every perfect matching is envy-free, but envy-free …

We consider the house allocation problem, where m houses are to be assigned to n agents
so that each agent gets exactly one house. We present a polynomial-time algorithm that …

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 …

House allocation refers to the problem where m houses are to be allocated to n agents so
that each agent receives one house. Since an envy-free house allocation does not always …

Envy-freeness up to one good (EF1) is a well-studied fairness notion for indivisible goods
that addresses pairwise envy by the removal of at most one good. In the worst case, each …

We consider the classical problem of allocating indivisible resources among agents in an
envy-free (and, where applicable, proportional) way. Recently, the basic model was …

We study the problem of allocating indivisible objects to a set of rational agents where each
agent's final utility depends on the intrinsic valuation of the allocated item as well as the …