A Framework to Maximize Group Fairness for Workers on Online Labor Platforms

Anis El Rabaa (1) , Shady Elbassuoni (1) , Jihad Hanna (1) , Amer Mouawad (1) , Ayham Olleik (1) , Sihem Amer-Yahia (2)

1 AUB - American University of Beirut [Beyrouth]
2 LIG - Laboratoire d'Informatique de Grenoble

As 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.

Domaines: Informatique [cs]

Anis El Rabaa, Shady Elbassuoni, Jihad Hanna, Amer Mouawad, Ayham Olleik, et al.. A Framework to Maximize Group Fairness for Workers on Online Labor Platforms. Data Science and Engineering, 2023, 8 (2), pp.146-176. ⟨10.1007/s41019-023-00213-y⟩. ⟨hal-04239848⟩