Fair allocation of two types of chores
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 …
assume that the chores are divided into two types and under this scenario, we present …
Fair allocation in graphs
G Christodoulou, A Fiat, E Koutsoupias… - Proceedings of the 24th …, 2023 - dl.acm.org
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 …
represented via a graph of arbitrary size where vertices correspond to agents and edges to …
Unified fair allocation of goods and chores via copies
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 …
a unified framework for studying:(1) the existence of EFX and other solution concepts for …
New algorithms for the fair and efficient allocation of indivisible chores
J Garg, A Murhekar, J Qin - arXiv preprint arXiv:2212.02440, 2022 - arxiv.org
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 …
additive disutility functions. We consider the widely-used envy-based fairness properties of …
The Complexity of Fair Division of Indivisible Items with Externalities
A Deligkas, E Eiben, V Korchemna… - Proceedings of the AAAI …, 2024 - ojs.aaai.org
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 …
externalities. In this recently-proposed setting, in addition to the utility the agent gets from …
[PDF][PDF] Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey.
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 …
the corresponding problems are known to be NP-hard for many fairness concepts, so unless …
On The Pursuit of EFX for Chores: Non-Existence and Approximations
V Christoforidis, C Santorinaios - arXiv preprint arXiv:2406.10752, 2024 - arxiv.org
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 …
of envy-free up to any item (EFX) allocations is a long-standing open question for both …
FairHash: A Fair and Memory/Time-efficient Hashmap
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 …
research on constructing hashmaps that minimize the number of collisions leading to …
Distribution of Chores with Information Asymmetry
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 …
to a large body of work in recent years. A popular approximate fairness notion is envy …
A Fair and Memory/Time-efficient Hashmap
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 …
However, to the best of our knowledge no known hashing technique guarantees group …