Subgroup Fairness in Two-Sided Markets
Not on the map. Why?
Abstract (arXiv)
It is well known that two-sided markets are unfair in a number of ways. For instance, female workers at Uber earn less than their male colleagues per mile driven. Similar observations have been made for other minority subgroups in other two-sided markets. Here, we suggest a novel market-clearing mechanism for two-sided markets, which promotes equalisation of the pay per hour worked across multiple subgroups, as well as within each subgroup. In the process, we introduce a novel notion of subgroup fairness (which we call Inter-fairness), which can be combined with other notions of fairness within each subgroup (called Intra-fairness), and the utility for the customers (Customer-Care) in the objective of the market-clearing problem. While the novel non-linear terms in the objective complicate market clearing by making the problem non-convex, we show that a certain non-convex augmented Lagrangian relaxation can be approximated to any precision in time polynomial in the number of market participants using semi-definite programming. This makes it possible to implement the market-clearing mechanism efficiently. On the example of driver-ride assignment in an Uber-like system, we demonstrate the efficacy and scalability of the approach, and trade-offs between Inter- and Intra-fairness.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 28 of its 123 references that are in the map. First posted on arXiv 4 Jun 2021.
Builds on
28 of 123 references.
References · 28
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2017Counterfactual Fairnesscited by 804
- 2020Fairness without Demographics through Adversarially Reweighted Learningcited by 251
- 2018A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual & Group Unfairness via Inequality Indicescited by 97
- 2020Robust Optimization for Fairness with Noisy Protected Groupscited by 78
- 2020FairRec: Two-Sided Fairness for Personalized Recommendations in Two-Sided Platformscited by 78
- 2020Controlling Fairness and Bias in Dynamic Learning-to-Rankcited by 68
- 2019Average Individual Fairness: Algorithms, Generalization and Experimentscited by 46
- 2020Time-Varying Convex Optimization: Time-Structured Algorithms and Applicationscited by 31
- 2020User Fairness, Item Fairness, and Diversity for Rankings in Two-Sided Marketscited by 23
- 2020Review of Mathematical frameworks for Fairness in Machine Learningcited by 21
- 2021Regret, stability & fairness in matching markets with bandit learnerscited by 20
16 more
- 2019Balancing the Tradeoff between Profit and Fairness in Rideshare Platforms During High-Demand Hourscited by 17
- 2020Beyond Individual and Group Fairnesscited by 13
- 2020Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extensioncited by 11
- 2019Fairness-Efficiency Tradeoffs in Dynamic Fair Divisioncited by 9
- 2018Dynamic Type Matchingcited by 8
- 2020Edge-Weighted Online Bipartite Matchingcited by 8
- 2018Balancing Relevance and Diversity in Online Bipartite Matching via Submodularitycited by 7
- 2017Diverse Weighted Bipartite b-Matchingcited by 6
- 2020Group-Fair Online Allocation in Continuous Timecited by 6
- 2018On the Ergodic Control of Ensemblescited by 5
- 2020CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimizationcited by 5
- 2018Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Modelcited by 4
- 2018How to Match when All Vertices Arrive Onlinecited by 3
- 2017Online Bipartite Matching with Amortized O(log2 n) Replacementscited by 2
- 2020Mixed-Integer Path-Stable Optimisation, with Applications in Model-Predictive Control of Water Systemscited by 1
- 2020Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescuecited by 1
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1.
3 papers.
- 2022Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individualcited by 7
- 2024Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Optioncited by 0
- 2025Benchmarking Stochastic Approximation Algorithms for Fairness-Constrained Training of Deep Neural Networkscited by 0
- 2025Benchmarking Stochastic Approximation Algorithms for Fairness-Constrained Training of Deep Neural Networks5 Jul 2025
- 2024Design a Win-Win Strategy That Is Fair to Both Service Providers and Tasks When Rejection Is Not an Option22 May 2024
- 2022Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual16 Jan 2022