{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T20:40:06Z","timestamp":1770496806865,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000010","name":"Ford Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000010","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100016263","name":"University Research Board, American University of Beirut","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100016263","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1007\/s41019-023-00213-y","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T17:02:01Z","timestamp":1682528521000},"page":"146-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Framework to Maximize Group Fairness for Workers on Online Labor Platforms"],"prefix":"10.1007","volume":"8","author":[{"given":"Anis El","family":"Rabaa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3491-6311","authenticated-orcid":false,"given":"Shady","family":"Elbassuoni","sequence":"additional","affiliation":[]},{"given":"Jihad","family":"Hanna","sequence":"additional","affiliation":[]},{"given":"Amer E.","family":"Mouawad","sequence":"additional","affiliation":[]},{"given":"Ayham","family":"Olleik","sequence":"additional","affiliation":[]},{"given":"Sihem","family":"Amer-Yahia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"213_CR1","unstructured":"Amer-Yahia S, Elbassuoni S, Ghizzawi A, et\u00a0al (2020) Fairness in online jobs:$$\\{$$A$$\\}$$ case study on taskrabbit and google. In: Int Conf Ext Database Technol (EDBT)"},{"key":"213_CR2","doi-asserted-by":"crossref","unstructured":"Beutel A, Chen J, Doshi T, et\u00a0al (2019) Fairness in recommendation ranking through pairwise comparisons. In: Proc 25th ACM SIGKDD Int Conf Knowl Discov & Data Min, pp 2212\u20132220","DOI":"10.1145\/3292500.3330745"},{"key":"213_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013414","DOI":"10.1145\/3209978.3210063"},{"issue":"2","key":"213_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10618-010-0190-x","volume":"21","author":"T Calders","year":"2010","unstructured":"Calders T, Verwer S (2010) Three naive bayes approaches for discrimination-free classification. Data Min Knowl Disc 21(2):277\u2013292. https:\/\/doi.org\/10.1007\/s10618-010-0190-x","journal-title":"Data Min Knowl Disc"},{"key":"213_CR5","unstructured":"Celis LE, Straszak D, Vishnoi NK (2017) Ranking with fairness constraints. arXiv preprint arXiv:1704.06840"},{"key":"213_CR6","doi-asserted-by":"crossref","unstructured":"Chen L, Ma R, Hann\u00e1k A, et\u00a0al (2018) Investigating the impact of gender on rank in resume search engines. In: Proc 2018 chi Conf Hum Fact Comput Syst, pp 1\u201314","DOI":"10.1145\/3173574.3174225"},{"key":"213_CR7","doi-asserted-by":"crossref","unstructured":"Dong Y, Kang J, Tong H, et\u00a0al (2021) Individual fairness for graph neural networks: a ranking based approach. In: Proc 27th ACM SIGKDD Conf Knowl Discov & Data Min, pp 300\u2013310","DOI":"10.1145\/3447548.3467266"},{"key":"213_CR8","unstructured":"Elbassuoni S, Amer-Yahia S, Ghizzawi A, et\u00a0al (2019) Exploring fairness of ranking in online job marketplaces. In: 22nd Int Conf Ext Database Technol (EDBT)"},{"issue":"4","key":"213_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3402883","volume":"1","author":"S Elbassuoni","year":"2020","unstructured":"Elbassuoni S, Amer-Yahia S, Ghizzawi A (2020) Fairness of scoring in online job marketplaces. ACM Trans Data Sci 1(4):1\u201330","journal-title":"ACM Trans Data Sci"},{"issue":"4","key":"213_CR10","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/S0022-0000(03)00026-6","volume":"66","author":"R Fagin","year":"2003","unstructured":"Fagin R, Lotem A, Naor M (2003) Optimal aggregation algorithms for middleware. J Comput Syst Sci 66(4):614\u2013656","journal-title":"J Comput Syst Sci"},{"issue":"9","key":"213_CR11","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32","author":"ML Fisher","year":"1986","unstructured":"Fisher ML, Jaikumar R, Van Wassenhove LN (1986) A multiplier adjustment method for the generalized assignment problem. Manage Sci 32(9):1095\u20131103","journal-title":"Manage Sci"},{"key":"213_CR12","doi-asserted-by":"crossref","unstructured":"Foulds JR, Islam R, Keya KN, et\u00a0al (2020) An intersectional definition of fairness. In: 2020 IEEE 36th Int Conf Data Eng (ICDE), IEEE, pp 1918\u20131921","DOI":"10.1109\/ICDE48307.2020.00203"},{"key":"213_CR13","doi-asserted-by":"crossref","unstructured":"Geyik SC, Ambler S, Kenthapadi K (2019) Fairness-aware ranking in search & recommendation systems with application to linkedin talent search. In: Proce 25th acm sigkdd Int Conf Knowl Discov & Data Min, pp 2221\u20132231","DOI":"10.1145\/3292500.3330691"},{"key":"213_CR14","unstructured":"Ghizzawi A, Marinescu J, Elbassuoni S, et\u00a0al (2019) Fairank: an interactive system to explore fairness of ranking in online job marketplaces. In: 22nd Int Conf Ext Database Technol (EDBT)"},{"key":"213_CR15","unstructured":"Ghosh A, Genuit L, Reagan M (2021) Characterizing intersectional group fairness with worst-case comparisons. In: Artif Intell Divers, Belong, Equity, and Incl, PMLR, pp 22\u201334"},{"key":"213_CR16","doi-asserted-by":"crossref","unstructured":"Hannak A, Wagner C, Garcia D, et\u00a0al (2017) Bias in online freelance marketplaces: evidence from taskrabbit and fiverr. In: Proc 2017 ACM Conf Comput Support Coop Work Soc Comput, CSCW 2017, Portland, OR, USA, February 25 - March 1, 2017, pp 1914\u20131933","DOI":"10.1145\/2998181.2998327"},{"key":"213_CR17","doi-asserted-by":"crossref","unstructured":"Jahanbakhsh F, Cranshaw J, Counts S, et\u00a0al (2020) An experimental study of bias in platform worker ratings: the role of performance quality and gender. In: Proc 2020 CHI Conf Hum Fact Comput Syst, pp 1\u201313","DOI":"10.1145\/3313831.3376860"},{"key":"213_CR18","unstructured":"Karabakal N, Bean JC, Lohmann JR (1993) A steepest decent [sic] multiplier adjustment method for the generalized assignment problem. Tech rep"},{"issue":"2","key":"213_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/1314215.1314224","volume":"51","author":"MT Keane","year":"2008","unstructured":"Keane MT, O\u2019Brien M, Smyth B (2008) Are people biased in their use of search engines? Commun ACM 51(2):49\u201352","journal-title":"Commun ACM"},{"key":"213_CR20","unstructured":"Lagoudakis MG (1996) The 0-1 knapsack problem\u2013an introductory survey"},{"key":"213_CR21","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons Inc, USA"},{"key":"213_CR22","unstructured":"Morina G, Oliinyk V, Waton J, et\u00a0al (2019) Auditing and achieving intersectional fairness in classification problems. arXiv preprint arXiv:1911.01468"},{"key":"213_CR23","doi-asserted-by":"crossref","unstructured":"Naghiaei M, Rahmani HA, Deldjoo Y (2022) Cpfair: personalized consumer and producer fairness re-ranking for recommender systems. In: Proc 45th Int ACM SIGIR Conf Res Develop Inf Retr, pp 770\u2013779","DOI":"10.1145\/3477495.3531959"},{"key":"213_CR24","doi-asserted-by":"crossref","unstructured":"Oosterhuis H (2021) Computationally efficient optimization of plackett-luce ranking models for relevance and fairness. In: Proc 44th Int ACM SIGIR Conf Res Develop Inf Retr, pp 1023\u20131032","DOI":"10.1145\/3404835.3462830"},{"issue":"4","key":"213_CR25","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01720977","volume":"17","author":"IH Osman","year":"1995","unstructured":"Osman IH (1995) Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches. Oper Res Spektrum 17(4):211\u2013225","journal-title":"Oper Res Spektrum"},{"key":"213_CR26","doi-asserted-by":"crossref","unstructured":"Patro GK, Biswas A, Ganguly N et al (2020) Fairrec: two-sided fairness for personalized recommendations in two-sided platforms. Proc Web Conf 2020:1194\u20131204","DOI":"10.1145\/3366423.3380196"},{"issue":"3","key":"213_CR27","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10589-011-9432-0","volume":"52","author":"M Posta","year":"2012","unstructured":"Posta M, Ferland JA, Michelon P (2012) An exact method with variable fixing for solving the generalized assignment problem. Comput Optim Appl 52(3):629\u2013644","journal-title":"Comput Optim Appl"},{"key":"213_CR28","doi-asserted-by":"crossref","unstructured":"Raj A, Ekstrand MD (2022) Measuring fairness in ranked results: an analytical and empirical comparison. In: Proc 45th Int ACM SIGIR Conf Res Develop Inf Retr, pp 726\u2013736","DOI":"10.1145\/3477495.3532018"},{"issue":"3","key":"213_CR29","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/poi3.153","volume":"9","author":"A Rosenblat","year":"2017","unstructured":"Rosenblat A, Levy KE, Barocas S et al (2017) Discriminating tastes: uber\u2019s customer ratings as vehicles for workplace discrimination. Policy Internet 9(3):256\u2013279","journal-title":"Policy Internet"},{"key":"213_CR30","doi-asserted-by":"crossref","unstructured":"Salimi B, Rodriguez L, Howe B, et\u00a0al (2019) Interventional fairness: causal database repair for algorithmic fairness. In: Proc 2019 Int Conf Manag Data, pp 793\u2013810","DOI":"10.1145\/3299869.3319901"},{"key":"213_CR31","doi-asserted-by":"crossref","unstructured":"Singh A, Joachims T (2018a) Fairness of exposure in rankings. In: Proc 24th ACM SIGKDD Int Conf Knowl Discov & Data Min, KDD 2018, London, UK, August 19-23, 2018, pp 2219\u20132228","DOI":"10.1145\/3219819.3220088"},{"key":"213_CR32","doi-asserted-by":"crossref","unstructured":"Singh A, Joachims T (2018b) Fairness of exposure in rankings. In: Proc 24th ACM SIGKDD Int Conf Knowl Discov & Data Min, pp 2219\u20132228","DOI":"10.1145\/3219819.3220088"},{"key":"213_CR33","volume-title":"Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall\/Crc Computer & Information Science Series)","author":"M Yagiura","year":"2007","unstructured":"Yagiura M, Ibaraki T (2007) Generalized assignment problem. In: Gonzalez TF (ed) Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall\/Crc Computer & Information Science Series). Chapman & Hall\/CRC"},{"key":"213_CR34","doi-asserted-by":"crossref","unstructured":"Zehlike M, Castillo C (2020) Reducing disparate exposure in ranking: a learning to rank approach. Proc Web Conf 2020:2849\u20132855","DOI":"10.1145\/3366424.3380048"},{"key":"213_CR35","doi-asserted-by":"crossref","unstructured":"Zehlike M, Bonchi F, Castillo C, et\u00a0al (2017) Fa* ir: A fair top-k ranking algorithm. In: Proc 2017 ACM Conf Inf Knowl Manag, pp 1569\u20131578","DOI":"10.1145\/3132847.3132938"},{"issue":"1","key":"213_CR36","doi-asserted-by":"publisher","first-page":"102,707","DOI":"10.1016\/j.ipm.2021.102707","volume":"59","author":"M Zehlike","year":"2022","unstructured":"Zehlike M, S\u00fchr T, Baeza-Yates R et al (2022) Fair top-k ranking with multiple protected groups. Inf Process Manag 59(1):102,707","journal-title":"Inf Process Manag"},{"key":"213_CR37","unstructured":"Zliobaite I (2015) A survey on measuring indirect discrimination in machine learning. CoRR abs\/1511.00148. http:\/\/arxiv.org\/abs\/1511.00148"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00213-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-023-00213-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-023-00213-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T14:46:39Z","timestamp":1684161999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-023-00213-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["213"],"URL":"https:\/\/doi.org\/10.1007\/s41019-023-00213-y","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"2 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"N\/A.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"N\/A.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"N\/A.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}