Matchings with Group Fairness Constraints: Online and Offline Algorithms

@article{Sankar2021MatchingsWG,
  title={Matchings with Group Fairness Constraints: Online and Offline Algorithms},
  author={Govind S. Sankar and Anand Louis and Meghana Nasre and Prajakta Nimbhorkar},
  journal={ArXiv},
  year={2021},
  volume={abs/2105.09522}
}
We consider the problem of assigning items to platforms in the presence of group fairness constraints. In the input, each item belongs to certain categories, called classes in this paper. Each platform specifies the group fairness constraints through an upper bound on the number of items it can serve from each class. Additionally, each platform also has an upper bound on the total number of items it can serve. The goal is to assign items to platforms so as to maximize the number of items… 

Tables from this paper

Bipartite Matchings with Group Fairness and Individual Fairness Constraints

TLDR
This work addresses group as well as individual fairness constraints in matchings in the context of assigning items to platforms by providing a polynomial-time algorithm that computes a probabilistic individually fair distribution over group fair matchings.

Matchings Under Diversity Constraints

TLDR
The technical core of the proofs is a new connection between these problems and the problem of matchings in hypergraphs, which addresses a logistical challenge involving opening platforms in the presence of diversity constraints.

Class Fairness in Online Matching

TLDR
This work initiates the study of class fairness in this setting, where agents are partitioned into a set of classes and the matching is required to be fair with respect to the classes.

Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual

TLDR
This paper generalizes the existing work to offer fair treatment guarantees to both sides of the market simultaneously, at a calculated worst case drop to operator profit, and considers group and individual Rawlsian fairness criteria.

Measuring Fairness under Unawareness of Sensitive Attributes: A Quantification-Based Approach

TLDR
This work tackles the problem of measuring group fairness under unawareness of sensitive attributes, by using techniques from quantification, a supervised learning task concerned with directly providing group-level prevalence estimates (rather than individual-level class labels), and shows that quantification approaches are particularly suited to tackle the fairness-under-unawareness problem.

Fairness Maximization among Offline Agents in Online-Matching Markets

TLDR
This paper proposes online matching algorithms which optimize for either individual or group-level fairness among offline agents in OMMs, and presents two linear-programming (LP) based sampling algorithms, which achieve online competitive ratios at least 0.725 for individual fairness maximization (IFM) and 0.719 for group fairness maximizations (GFM), respectively.

Group Fairness for Knapsack Problems

TLDR
The fair knapsack problems encompass various important problems, such as participatory budgeting, fair budget allocation, advertising, and the total number of items from each category.

References

SHOWING 1-10 OF 42 REFERENCES

Group-level Fairness Maximization in Online Bipartite Matching

TLDR
This paper studies online bipartite matching from the perspective of group-level fairness, and the goal is to balance the number of matches made across different groups of online nodes.

Online budgeted matching in random input models with applications to Adwords

TLDR
An online assignment problem, motivated by Adwords Allocation, in which queries are to be assigned to bidders with budget constraints is studied, with a tight analysis of Greedy in this model showing that it has a competitive ratio of 1 - 1/e for maximizing the value of the assignment.

Near optimal online algorithms and fast approximation algorithms for resource allocation problems

TLDR
A new distributional model called the adversarial stochastic input model, which is a generalization of the i.i.d model with unknown distributions, where the distributions can change over time is introduced, and a 1-O(ε) approximation algorithm is given for the resource allocation problem.

UG-hardness to NP-hardness by losing half

TLDR
It is shown that the reduction can be transformed in a non-trivial way to give a stronger guarantee in the completeness case: for at least (1/2 - ε) fraction of the vertices on one side, all the constraints associated with them in the Unique Games instance can be satisfied.

How to match when all vertices arrive online

TLDR
A fully online model of maximum cardinality matching in which all vertices arrive online, and a novel charging mechanic is brought into the randomized primal dual technique by Devanur et al. (SODA 2013), allowing a vertex other than the two endpoints of a matched edge to share the gain.

Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching

TLDR
This is the first instance of a non-trivial randomized primal-dual algorithm in which the dual constraints only hold in expectation.

Online bipartite matching with unknown distributions

TLDR
This is the first analysis to show an algorithm which breaks the natural 1 - 1/e -barrier' in the unknown distribution model (the authors' analysis in fact works in the stricter, random order model) and answers an open question in [GM08].

Online Learning with an Unknown Fairness Metric

TLDR
An algorithm in the adversarial context setting that has a number of fairness violations that depends only logarithmically on $T$, while obtaining an optimal $O(\sqrt{T})$ regret bound to the best fair policy is proposed.

Online Stochastic Matching: Beating 1-1/e

TLDR
A novel application of the idea of the power of two choices from load balancing, which compute two disjoint solutions to the expected instance, and use both of them in the online algorithm in a prescribed preference order to characterize an upper bound for the optimum in any scenario.

Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness

In this paper, we consider the problem of computing an optimal matching in a bipartite graph \(G=(A\cup P, E)\) where elements of A specify preferences over their neighbors in P, possibly involving