Log In Sign Up

A General Framework for Fair Allocation with Matroid Rank Valuations

by   Vignesh Viswanathan, et al.

We study the problem of fairly allocating a set of indivisible goods among agents with matroid rank valuations. We present a simple framework that efficiently computes any fairness objective that satisfies some mild assumptions. Along with maximizing a fairness objective, the framework is guaranteed to run in polynomial time, maximize utilitarian social welfare and ensure strategyproofness. We show how our framework can be used to achieve four different fairness objectives: (a) Prioritized Lorenz dominance, (b) Maxmin fairness, (c) Weighted leximin, and (d) Max weighted Nash welfare. In particular, our framework provides the first polynomial time algorithms to compute weighted leximin and max weighted Nash welfare allocations for matroid rank valuations.


page 1

page 2

page 3

page 4


Two Birds With One Stone: Fairness and Welfare via Transfers

We study the question of dividing a collection of indivisible goods amon...

On Maximum Weighted Nash Welfare for Binary Valuations

We consider the problem of fairly allocating indivisible goods to agents...

Fair and Efficient Allocations under Subadditive Valuations

We study the problem of allocating a set of indivisible goods among agen...

Fair Graphical Resource Allocation with Matching-Induced Utilities

Motivated by real-world applications, we study the fair allocation of gr...

Weighted Envy-Freeness for Submodular Valuations

We investigate the fair allocation of indivisible goods to agents with p...

On Fair Virtual Conference Scheduling: Achieving Equitable Participant and Speaker Satisfaction

The (COVID-19) pandemic-induced restrictions on travel and social gather...

Enabling Long-term Fairness in Dynamic Resource Allocation

We study the fairness of dynamic resource allocation problem under the α...