Abstract
AbstractAs the number of online labor platforms and the diversity of jobs on these platforms increase, ensuring group fairness for workers needs to be the focus of job-matching services. Risk of discrimination against workers occurs in two different job-matching services: when someone is looking for a job (i.e., a job seeker) and when someone wants to deploy jobs (i.e., a job provider). To maximize their chances of getting hired, job seekers submit their profiles on different platforms. Similarly, job providers publish their job offers on multiple platforms with the goal of reaching a wide and diverse workforce. In this paper, we propose a theoretical framework to maximize group fairness for workers 1) when job seekers are looking for jobs on multiple platforms, and 2) when jobs are being deployed by job providers on multiple platforms. We formulate each goal as different optimization problems with different constraints, prove most of them are computationally hard to solve and propose various efficient algorithms to solve all of them in reasonable time. We then design a series of experiments that rely on synthetic and semi-synthetic data generated from a real-world online labor platform to evaluate our framework.
Funder
Ford Foundation
University Research Board, American University of Beirut
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Computational Mechanics
Reference37 articles.
1. Amer-Yahia S, Elbassuoni S, Ghizzawi A, et al (2020) Fairness in online jobs:$$\{$$A$$\}$$ case study on taskrabbit and google. In: Int Conf Ext Database Technol (EDBT)
2. Beutel A, Chen J, Doshi T, et al (2019) Fairness in recommendation ranking through pairwise comparisons. In: Proc 25th ACM SIGKDD Int Conf Knowl Discov & Data Min, pp 2212–2220
3. Biega AJ, Gummadi KP, Weikum G (2018) Equity of attention: amortizing individual fairness in rankings. In: The 41st Int acm sigir Conf Res & Develop Inf Retr, pp 405–414
4. Calders T, Verwer S (2010) Three naive bayes approaches for discrimination-free classification. Data Min Knowl Disc 21(2):277–292. https://doi.org/10.1007/s10618-010-0190-x
5. Celis LE, Straszak D, Vishnoi NK (2017) Ranking with fairness constraints. arXiv preprint arXiv:1704.06840