Fairness Maximization among Offline Agents in Online-Matching Markets

Will Ma, Pan Xu, Yifan Xu

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Online matching markets (OMMs) are commonly used in today's world to pair agents from two parties (whom we will call offline and online agents) for mutual benefit. However, studies have shown that the algorithms making decisions in these OMMs often leave disparities in matching rates, especially for offline agents. In this article, we propose online matching algorithms that optimize for either individual or group-level fairness among offline agents in OMMs. We present two linear-programming (LP) based sampling algorithms, which achieve competitive ratios at least 0.725 for individual fairness maximization and 0.719 for group fairness maximization. We derive further bounds based on fairness parameters, demonstrating conditions under which the competitive ratio can increase to 100%. There are two key ideas helping us break the barrier of 1-1/∼ 63.2% for competitive ratio in online matching. One is boosting, which is to adaptively re-distribute all sampling probabilities among only the available neighbors for every arriving online agent. The other is attenuation, which aims to balance the matching probabilities among offline agents with different mass allocated by the benchmark LP. We conduct extensive numerical experiments and results show that our boosted version of sampling algorithms are not only conceptually easy to implement but also highly effective in practical instances of OMMs where fairness is a concern.

Original languageEnglish (US)
Article number3569705
JournalACM Transactions on Economics and Computation
Volume10
Issue number4
DOIs
StatePublished - Apr 5 2023

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Statistics and Probability
  • Economics and Econometrics
  • Marketing
  • Computational Mathematics

Keywords

  • Fairness maximization
  • online matching markets

Fingerprint

Dive into the research topics of 'Fairness Maximization among Offline Agents in Online-Matching Markets'. Together they form a unique fingerprint.

Cite this