[HTML][HTML] Fair division of indivisible goods: Recent progress and open questions
Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …
times, with most of the early mathematical work on the problem focusing on resources that …
On approximate envy-freeness for indivisible chores and mixed resources
U Bhaskar, AR Sricharan, R Vaish - arXiv preprint arXiv:2012.06788, 2020 - arxiv.org
We study the fair allocation of undesirable indivisible items, or chores. While the case of
desirable indivisible items (or goods) is extensively studied, with many results known for …
desirable indivisible items (or goods) is extensively studied, with many results known for …
[HTML][HTML] On maximum weighted Nash welfare for binary valuations
W Suksompong, N Teh - Mathematical Social Sciences, 2022 - Elsevier
We consider the problem of fairly allocating indivisible goods to agents with weights
representing their entitlements. A natural rule in this setting is the maximum weighted Nash …
representing their entitlements. A natural rule in this setting is the maximum weighted Nash …
Envy-free allocations respecting social networks
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 …
multiagent systems. Often, non-trivial envy-free allocations do not exist and determining …
Fair Division of Indivisible Goods: Recent Progress and Open Questions
Allocating resources to individuals in a fair manner has been a topic of interest since ancient
times, with most of the early mathematical work on the problem focusing on resources that …
times, with most of the early mathematical work on the problem focusing on resources that …
Guaranteeing maximin shares: Some agents left behind
H Hosseini, A Searns - arXiv preprint arXiv:2105.09383, 2021 - arxiv.org
The maximin share (MMS) guarantee is a desirable fairness notion for allocating indivisible
goods. While MMS allocations do not always exist, several approximation techniques have …
goods. While MMS allocations do not always exist, several approximation techniques have …
Efficient fair division with minimal sharing
F Sandomirskiy, E Segal-Halevi - Operations Research, 2022 - pubsonline.informs.org
A collection of objects, some of which are good and some of which are bad, is to be divided
fairly among agents with different tastes, modeled by additive utility functions. If the objects …
fairly among agents with different tastes, modeled by additive utility functions. If the objects …
The Fairness Fair: Bringing Human Perception into Collective Decision-Making
H Hosseini - Proceedings of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
Fairness is one of the most desirable societal principles in collective decision-making. It has
been extensively studied in the past decades for its axiomatic properties and has received …
been extensively studied in the past decades for its axiomatic properties and has received …
Improving Resource Allocations by Sharing in Pairs
Given an initial resource allocation, where some agents may envy others or where a
different distribution of resources might lead to a higher social welfare, our goal is to improve …
different distribution of resources might lead to a higher social welfare, our goal is to improve …
Achieving envy-freeness and equitability with monetary transfers
H Aziz - Proceedings of the AAAI Conference on Artificial …, 2021 - ojs.aaai.org
When allocating indivisible resources or tasks, an envy-free allocation or equitable
allocation may not exist. We present a sufficient condition and an algorithm to achieve envy …
allocation may not exist. We present a sufficient condition and an algorithm to achieve envy …