collaborators

8 papers

cs.GT2026

Constrained Fair Allocations via Partition Matroid Reductions

Benjamin Cookson, Nisarg Shah

We study fair allocation of indivisible goods under additive valuations and matroid constraints. A challenging open question is whether a complete and feasible envy-free up to one…

cs.GT2026

Optimally Selecting Representative Agents from a Metric Space

Benjamin Cookson, Eva Deltl, Yeeseok Oh

This paper studies the problem of proportionally fair clustering, where the goal is to select ``centers'' from a metric space that fairly represent a set of agents who also lie…

cs.GT2026

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…

cs.GT2026

Proportional Fairness for Harmful Decisions

Benjamin Cookson, Soroush Ebadian, Dominik Peters +1

We study allocation of (divisible) public bads, where agents incur costs for alternatives and the goal is to pick a lottery over the alternatives. We show that the traditional defi…

cs.GT2026

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…

cs.GT2026

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…

cs.GT2024

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…

cs.GT2024

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…