From the 1 of 6 linked papers with an AI index.
6 papers · 1 filter
Fair and Efficient Balanced Allocations for Additive Valuations
Benjamin Cookson, Nisarg Shah, Paritosh Verma
We study the existence of fair and efficient allocations of indivisible goods under the balancedness constraint, which requires that any two agents' bundles differ in size by at mo…
Proportional Fairness for Harmful Decisions
Benjamin Cookson, Soroush Ebadian, Dominik Peters +1
The paper investigates how to fairly allocate divisible public bads by redefining the core for such settings and showing that Lindahl equilibria can satisfy these new fairness crit…
Improved Lower Bounds for Proportionally Fair Clustering
Benjamin Cookson, Eva Deltl, Yeeseok Oh
We study proportionally fair clustering, where a set of centers must be chosen from a metric space to represent agents, and no sufficiently large group of agents should be…
Unifying Proportional Fairness in Centroid and Non-Centroid Clustering
Benjamin Cookson, Nisarg Shah, Ziqi Yu
Proportional fairness criteria inspired by democratic ideals of proportional representation have received growing attention in the clustering literature. Prior work has investigate…
Constrained Fair and Efficient Allocations
Benjamin Cookson, Soroush Ebadian, Nisarg Shah
Fairness and efficiency have become the pillars of modern fair division research, but prior work on achieving both simultaneously is largely limited to the unconstrained setting. W…
Temporal Fair Division
Benjamin Cookson, Soroush Ebadian, Nisarg Shah
We study temporal fair division, whereby a set of agents are allocated a (possibly different) set of goods on each day for a period of days. We study this setting, as well as a num…