We consider the classic problem of fairly allocating indivisible goods among agents with
additive valuation functions and explore the connection between two prominent fairness …

Several relaxations of envy-freeness, tailored to fair division in settings with indivisible
goods, have been introduced within the last decade. Due to the lack of general existence …

We study envy-free up to any item (EFX) allocations on graphs where vertices and edges
represent agents and items respectively. An agent is only interested in items that are …

In this paper we study the problem of finding fair and efficient allocations of a mixed manna,
ie, a set M of discrete items that are goods/chores, among a set N of agents with additive …

In fair division problems, we are given a set $ S $ of $ m $ items and a set $ N $ of $ n $
agents with individual preferences, and the goal is to find an allocation of items among …

We consider the problem of fairly and efficiently allocating indivisible items (goods or bads)
under capacity constraints. In this setting, we are given a set of categorized items. Each …

Fair resource allocation is an important problem in many real-world scenarios, where
resources such as goods and chores must be allocated among agents. In this survey, we …

In load-balancing problems there is a set of clients, each wishing to select a resource from a
set of permissible ones to execute a certain task. Each resource has a latency function …

We study the problem of finding fair and efficient allocations of a set of indivisible items to a
set of agents, where each item may be a good (positively valued) for some agents and a bad …

We study envy-free up to any item (EFX) allocations on graphs where vertices and edges
represent agents and items respectively. An agent is only interested in items that are …