Conference paper · 2022 · Open access
Group-level Fairness Maximization in Online Bipartite Matching
Adaptive Agents and Multi-Agents Systems, 1687–1689 · Published 9 May 2022 · DOI 10.65109/psce2714
In brief
“Group-level Fairness Maximization in Online Bipartite Matching” is a 2022 conference paper by Will Ma and 2 co-authors, published in Adaptive Agents and Multi-Agents Systems. OpenAlex counts 56 citations as of 20 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 56
- Most cited in
- 2025 (14)
- Field-weighted impact
- 6.81
- References
- 43
- Authors
- 3
Abstract
We consider the allocation of limited resources to heterogeneous customers who arrive in an online fashion. We would like to allocate the resources ''fairly'', so that no group of customers is marginalized in terms of their overall service rate. We study whether this is possible to do so in an online fashion, and if so, what a good online allocation policy is. We model this problem using online bipartite matching under stationary arrivals, a fundamental model in the literature typically studied under the objective of maximizing the total number of customers served. We instead study the objective of maximizing the minimum service rate across all groups, and propose two notions of fairness: long-run and short-run. For these fairness objectives, we analyze how competitive online algorithms can be, in comparison to offline algorithms which know the sequence of demands in advance. For long-run fairness, we propose two online heuristics (Sampling and Pooling) which establish asymptotic optimality in different regimes (no specialized supplies, no rare demand types, or imbalanced supply/demand). By contrast, outside all of these regimes, we show that the competitive ratio of online algorithms is between 0.632 and 0.732. For short-run fairness, we show for complete bipartite graphs that the competitive ratio of online algorithms is between 0.863 and 0.942; we also derive a probabilistic rejection algorithm which is asymptotically optimal in the total demand. Depending on the overall scarcity of resources, either our Sampling or Pooling heuristics could be desirable. The most difficult situation for online allocation occurs when the total supply is just enough to serve the total demand, in which case an organization could try to make allocations offline instead. We simulate our algorithms on a public ride-hailing dataset, which both demonstrates the efficacy of our heuristics and validates our managerial insights.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Ma, W., Xu, P., & Xu, Y. (2022). Group-level Fairness Maximization in Online Bipartite Matching. Adaptive Agents and Multi-Agents Systems, 1687–1689. https://doi.org/10.65109/psce2714
MLA 9
Ma, Will, et al. “Group-level Fairness Maximization in Online Bipartite Matching.” Adaptive Agents and Multi-Agents Systems, 2022, pp. 1687–1689. https://doi.org/10.65109/psce2714.
Chicago
Ma, Will, Pan Xu, and Yifan Xu. 2022. “Group-level Fairness Maximization in Online Bipartite Matching.” Adaptive Agents and Multi-Agents Systems: 1687–1689. https://doi.org/10.65109/psce2714.
Harvard
Ma, W., Xu, P. and Xu, Y. (2022) ‘Group-level Fairness Maximization in Online Bipartite Matching’, Adaptive Agents and Multi-Agents Systems, pp. 1687–1689. doi:10.65109/psce2714.
IEEE
W. Ma, P. Xu, and Y. Xu, “Group-level Fairness Maximization in Online Bipartite Matching,” Adaptive Agents and Multi-Agents Systems, pp. 1687–1689, 2022, doi: 10.65109/psce2714.
BibTeX
@inproceedings{ma2022group,
title = {{Group-level Fairness Maximization in Online Bipartite Matching}},
author = {Ma, Will and Xu, Pan and Xu, Yifan},
booktitle = {Adaptive Agents and Multi-Agents Systems},
year = {2022},
pages = {1687--1689},
doi = {10.65109/psce2714},
url = {https://doi.org/10.65109/psce2714}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 1 | |
| 2021 | 8 | |
| 2022 | 7 | |
| 2023 | 9 | |
| 2024 | 12 | |
| 2025 | 14 | |
| 2026 | 5 |
Its field-weighted citation impact is 6.81: it has been cited 6.81 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- online bipartite matching
- group fairness
- resource allocation
- competitive ratio
- ride-hailing
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Ma, W., Xu, P., & Xu, Y. (2022). Group-level Fairness Maximization in Online Bipartite Matching. Adaptive Agents and Multi-Agents Systems, 1687–1689. https://doi.org/10.65109/psce2714
How many times has this paper been cited?
56 times, according to OpenAlex on 20 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Will Ma, Pan Xu, Yifan Xu.
What is the DOI of this paper?
10.65109/psce2714, permanently at https://doi.org/10.65109/psce2714. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 20 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.