Fair Division Under Cardinality Constraints

by   Siddharth Barman, et al.

We consider the problem of fairly allocating indivisible goods, among agents, under cardinality constraints and additive valuations. In this setting, we are given a partition of the entire set of goods---i.e., the goods are categorized---and a limit is specified on the number of goods that can be allocated from each category to any agent. The objective here is to find a fair allocation in which the subset of goods assigned to any agent satisfies the given cardinality constraints. This problem naturally captures a number of resource-allocation applications, and is a generalization of the well-studied (unconstrained) fair division problem. The two central notions of fairness, in the context of fair division of indivisible goods, are envy freeness up to one good (EF1) and the (approximate) maximin share guarantee (MMS). We show that the existence and algorithmic guarantees established for these solution concepts in the unconstrained setting can essentially be achieved under cardinality constraints. Specifically, we develop efficient algorithms which compute EF1 and approximately MMS allocations in the constrained setting. Furthermore, focusing on the case wherein all the agents have the same additive valuation, we establish that EF1 locations exist even under matroid constraints.


page 1

page 2

page 3

page 4


A Little Charity Guarantees Almost Envy-Freeness

Fair division of indivisible goods is a very well-studied problem. The g...

Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements

We consider the problem of fair allocation of indivisible goods or chore...

Guaranteeing Half-Maximin Shares Under Cardinality Constraints

We study the problem of fair allocation of a set of indivisible items am...

Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents

We propose a notion of algorithmic stability for scenarios where cardina...

Approximate #Knapsack Computations to Count Semi-Fair Allocations

In this paper, we study the problem of counting the number of different ...

Two-Sided Matching Meets Fair Division

We introduce a new model for two-sided matching which allows us to borro...

The Importance of System-Level Information in Multiagent Systems Design: Cardinality and Covering Problems

A fundamental challenge in multiagent systems is to design local control...

Please sign up or login with your details

Forgot password? Click here to reset