We consider the problem of fair allocation of indivisible chores under additive valuations. We
assume that the chores are divided into two types and under this scenario, we present …

We study envy freeness up to any good (EFX) in settings where valuations can be
represented via a graph of arbitrary size where vertices correspond to agents and edges to …

We consider fair allocation of indivisible items in a model with goods, chores, and copies, as
a unified framework for studying:(1) the existence of EFX and other solution concepts for …

We study the problem of fairly and efficiently allocating indivisible chores among agents with
additive disutility functions. We consider the widely-used envy-based fairness properties of …

We study the computational complexity of fairly allocating a set of indivisible items under
externalities. In this recently-proposed setting, in addition to the utility the agent gets from …

Fair allocation of indivisible goods is a central topic in many AI applications. Unfortunately,
the corresponding problems are known to be NP-hard for many fairness concepts, so unless …

We study the problem of fairly allocating a set of chores to a group of agents. The existence
of envy-free up to any item (EFX) allocations is a long-standing open question for both …

Hashmap is a fundamental data structure in computer science. There has been extensive
research on constructing hashmaps that minimize the number of collisions leading to …

Fair distribution of indivisible tasks with non-positive valuations (aka chores) has given rise
to a large body of work in recent years. A popular approximate fairness notion is envy …

There is a large amount of work constructing hashmaps to minimize the number of collisions.
However, to the best of our knowledge no known hashing technique guarantees group …