[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 …
Weighted fairness notions for indivisible items revisited
We revisit the setting of fairly allocating indivisible items when agents have different weights
representing their entitlements. First, we propose a parameterized family of relaxations for …
representing their entitlements. First, we propose a parameterized family of relaxations for …
Yankee swap: a fast and simple fair allocation mechanism for matroid rank valuations
We study fair allocation of indivisible goods when agents have matroid rank valuations. Our
main contribution is a simple algorithm based on the colloquial Yankee Swap procedure that …
main contribution is a simple algorithm based on the colloquial Yankee Swap procedure that …
Truthful and fair mechanisms for matroid-rank valuations
We study the problem of allocating indivisible goods among strategic agents. We focus on
settings wherein monetary transfers are not available and each agent's private valuation is a …
settings wherein monetary transfers are not available and each agent's private valuation is a …
A general framework for fair allocation under matroid rank valuations
We study the problem of fairly allocating a set of indivisible goods among agents with
matroid rank valuations---every good provides a marginal value of 0 or 1 when added to a …
matroid rank valuations---every good provides a marginal value of 0 or 1 when added to a …
On fair division under heterogeneous matroid constraints
We study fair allocation of indivisible goods among additive agents with feasibility
constraints. In these settings, every agent is restricted to get a bundle among a specified set …
constraints. In these settings, every agent is restricted to get a bundle among a specified set …
Weighted envy-freeness for submodular valuations
L Montanari, U Schmidt-Kraepelin… - Proceedings of the …, 2024 - ojs.aaai.org
We investigate the fair allocation of indivisible goods to agents with possibly different
entitlements represented by weights. Previous work has shown that guarantees for additive …
entitlements represented by weights. Previous work has shown that guarantees for additive …
Class fairness in online matching
We initiate the study of fairness among classes of agents in online bipartite matching where
there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that …
there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that …
Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem
In this work, we study the maximin share fairness notion (MMS) for allocation of indivisible
goods in the subadditive and fractionally subadditive settings. While previous work refutes …
goods in the subadditive and fractionally subadditive settings. While previous work refutes …
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 …