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

@inproceedings{Esmaeili2022RawlsianFI,
  title={Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual},
  author={Seyed-Alireza Esmaeili and Sharmila Duppala and Vedant Nanda and Aravind Srinivasan and John P. Dickerson},
  booktitle={AAMAS},
  year={2022}
}
Online bipartite-matching platforms are ubiquitous and find applications in important areas such as crowdsourcing and ridesharing. In the most general form, the platform consists of three entities: two sides to be matched and a platform operator that decides the matching. The design of algorithms for such platforms has traditionally focused on the operator’s (expected) profit. Recent reports have shown that certain demographic groups may receive less favorable treatment under pure profit… 
2 Citations

Figures and Tables from this paper

Bipartite Matchings with Group Fairness and Individual Fairness Constraints

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

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.

References

SHOWING 1-10 OF 38 REFERENCES

Group-level Fairness Maximization in Online Bipartite Matching

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.

Two-Sided Fairness for Repeated Matchings in Two-Sided Markets: A Case Study of a Ride-Hailing Platform

This paper analyzes job assignments of a major taxi company and observes that there is significant inequality in the driver income distribution, and proposes a novel framework to think about fairness in the matching mechanisms of ride hailing platforms.

Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources

This paper proposes a new model, Online Matching with (offline) Reusable Resources under Known Adversarial Distributions (OM-RR-KAD), in which resources on the offline side are reusable instead of disposable; that is, once matched, resources become available again at some point in the future.

Matchings with Group Fairness Constraints: Online and Offline Algorithms

This paper considers the problem of assigning items to platforms in the presence of group fairness constraints, and shows that if the classes are arbitrary, then the problem is NP-hard and has a strong inapproximability.

Fairness Maximization among Offline Agents in Online-Matching Markets

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.

Balancing Relevance and Diversity in Online Bipartite Matching via Submodularity

The Online Submodular Bipartite Matching problem is proposed, where the goal is to maximize a submodular function over the set of matched edges, which is general enough to capture the notion of both diversity and relevance.

Balancing Efficiency and Fairness in On-Demand Ridesourcing

This paper gives an explicit answer to the question of whether there always exists an assignment that achieves any target efficiency and fairness and proposes a simple reassignment algorithm that can achieve any selected trade-off.

Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms during High-Demand Hours

A flexible, non-adaptive algorithm that allows the platform designer to control the profit and fairness of the system via parameters α and β respectively is presented and it is shown that NAdap under some choice of (α, β) can beat two natural heuristics, Greedy and Uniform, on both fairness and profit.

Online budgeted matching in random input models with applications to Adwords

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.

Online Stochastic Matching: Beating 1-1/e

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.