Loading…

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

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

Full description

Saved in:
Bibliographic Details
Published in:Data science and engineering 2023-06, Vol.8 (2), p.146-176
Main Authors: Rabaa, Anis El, Elbassuoni, Shady, Hanna, Jihad, Mouawad, Amer E., Olleik, Ayham, Amer-Yahia, Sihem
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites cdi_FETCH-LOGICAL-c487t-b1cc81566ca68e2b0a00c6ef0b8fa6611dadc5e13c7a37b149c36b1b5a1bc7b53
container_end_page 176
container_issue 2
container_start_page 146
container_title Data science and engineering
container_volume 8
creator Rabaa, Anis El
Elbassuoni, Shady
Hanna, Jihad
Mouawad, Amer E.
Olleik, Ayham
Amer-Yahia, Sihem
description 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.
doi_str_mv 10.1007/s41019-023-00213-y
format article
fullrecord <record><control><sourceid>proquest_doaj_</sourceid><recordid>TN_cdi_doaj_primary_oai_doaj_org_article_7f0e12564d1041d1882132c84b50acb2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><doaj_id>oai_doaj_org_article_7f0e12564d1041d1882132c84b50acb2</doaj_id><sourcerecordid>2890355957</sourcerecordid><originalsourceid>FETCH-LOGICAL-c487t-b1cc81566ca68e2b0a00c6ef0b8fa6611dadc5e13c7a37b149c36b1b5a1bc7b53</originalsourceid><addsrcrecordid>eNp9kU1v1DAQhiMEElXbP8DJEicOgRl_xTmuKratFFQOII7W2HFKlmy82LvA8uvxNgXEhZOt8fM-0vitqhcIrxGgeZMlArY1cFEDcBT18Ul1xoWWNSqJT3_f0ajn1WXOGzhRaKTUZ1W3YutE2_A9pi9sH9k7-jFux5-BXad42LE1jWkOObMhJvapMCFlFmd2N0_jHFhHrszfT7Qv79t8UT0baMrh8vE8rz6u3364uqm7u-vbq1VXe2mafe3Qe4NKa0_aBO6AALwOAzgzkNaIPfVeBRS-IdE4lK0X2qFThM43Tonz6nbx9pE2dpfGLaWjjTTah0FM95bSfvRTsM0AAbnSskeQ2KMx5YO4N9IpIO94cb1aXJ9p-kd1s-rsaQaSi9ZI8w0L-3Jhdyl-PYS8t5t4SHNZ1XLTglCqVU2h-EL5FHNOYfijRbCnwuxSmC2F2YfC7LGExBLKBZ7vQ_qr_k_qFwPxlow</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2890355957</pqid></control><display><type>article</type><title>A Framework to Maximize Group Fairness for Workers on Online Labor Platforms</title><source>Springer Nature - SpringerLink Journals - Fully Open Access </source><source>Publicly Available Content (ProQuest)</source><creator>Rabaa, Anis El ; Elbassuoni, Shady ; Hanna, Jihad ; Mouawad, Amer E. ; Olleik, Ayham ; Amer-Yahia, Sihem</creator><creatorcontrib>Rabaa, Anis El ; Elbassuoni, Shady ; Hanna, Jihad ; Mouawad, Amer E. ; Olleik, Ayham ; Amer-Yahia, Sihem</creatorcontrib><description>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.</description><identifier>ISSN: 2364-1185</identifier><identifier>EISSN: 2364-1541</identifier><identifier>DOI: 10.1007/s41019-023-00213-y</identifier><language>eng</language><publisher>Singapore: Springer Nature Singapore</publisher><subject>Algorithm Analysis and Problem Complexity ; Algorithms ; Artificial Intelligence ; Chemistry and Earth Sciences ; Computer engineering ; Computer Science ; Crowdsourcing ; Data Mining and Knowledge Discovery ; Database Management ; Employment ; Group fairness ; Job hunting ; Job provider ; Job seeker ; Labor ; Matching ; Online labor platforms ; Optimization ; Physics ; Platforms ; Research Paper ; Statistics for Engineering ; Synthetic data ; Systems and Data Security ; Workers</subject><ispartof>Data science and engineering, 2023-06, Vol.8 (2), p.146-176</ispartof><rights>The Author(s) 2023</rights><rights>The Author(s) 2023. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c487t-b1cc81566ca68e2b0a00c6ef0b8fa6611dadc5e13c7a37b149c36b1b5a1bc7b53</cites><orcidid>0000-0002-3491-6311 ; 0000-0002-6194-4502</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2890355957?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>230,314,780,784,885,25753,27924,27925,37012,44590</link.rule.ids><backlink>$$Uhttps://hal.science/hal-04239848$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Rabaa, Anis El</creatorcontrib><creatorcontrib>Elbassuoni, Shady</creatorcontrib><creatorcontrib>Hanna, Jihad</creatorcontrib><creatorcontrib>Mouawad, Amer E.</creatorcontrib><creatorcontrib>Olleik, Ayham</creatorcontrib><creatorcontrib>Amer-Yahia, Sihem</creatorcontrib><title>A Framework to Maximize Group Fairness for Workers on Online Labor Platforms</title><title>Data science and engineering</title><addtitle>Data Sci. Eng</addtitle><description>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.</description><subject>Algorithm Analysis and Problem Complexity</subject><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Chemistry and Earth Sciences</subject><subject>Computer engineering</subject><subject>Computer Science</subject><subject>Crowdsourcing</subject><subject>Data Mining and Knowledge Discovery</subject><subject>Database Management</subject><subject>Employment</subject><subject>Group fairness</subject><subject>Job hunting</subject><subject>Job provider</subject><subject>Job seeker</subject><subject>Labor</subject><subject>Matching</subject><subject>Online labor platforms</subject><subject>Optimization</subject><subject>Physics</subject><subject>Platforms</subject><subject>Research Paper</subject><subject>Statistics for Engineering</subject><subject>Synthetic data</subject><subject>Systems and Data Security</subject><subject>Workers</subject><issn>2364-1185</issn><issn>2364-1541</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><sourceid>DOA</sourceid><recordid>eNp9kU1v1DAQhiMEElXbP8DJEicOgRl_xTmuKratFFQOII7W2HFKlmy82LvA8uvxNgXEhZOt8fM-0vitqhcIrxGgeZMlArY1cFEDcBT18Ul1xoWWNSqJT3_f0ajn1WXOGzhRaKTUZ1W3YutE2_A9pi9sH9k7-jFux5-BXad42LE1jWkOObMhJvapMCFlFmd2N0_jHFhHrszfT7Qv79t8UT0baMrh8vE8rz6u3364uqm7u-vbq1VXe2mafe3Qe4NKa0_aBO6AALwOAzgzkNaIPfVeBRS-IdE4lK0X2qFThM43Tonz6nbx9pE2dpfGLaWjjTTah0FM95bSfvRTsM0AAbnSskeQ2KMx5YO4N9IpIO94cb1aXJ9p-kd1s-rsaQaSi9ZI8w0L-3Jhdyl-PYS8t5t4SHNZ1XLTglCqVU2h-EL5FHNOYfijRbCnwuxSmC2F2YfC7LGExBLKBZ7vQ_qr_k_qFwPxlow</recordid><startdate>20230601</startdate><enddate>20230601</enddate><creator>Rabaa, Anis El</creator><creator>Elbassuoni, Shady</creator><creator>Hanna, Jihad</creator><creator>Mouawad, Amer E.</creator><creator>Olleik, Ayham</creator><creator>Amer-Yahia, Sihem</creator><general>Springer Nature Singapore</general><general>Springer Nature B.V</general><general>Springer</general><general>SpringerOpen</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>1XC</scope><scope>VOOES</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-3491-6311</orcidid><orcidid>https://orcid.org/0000-0002-6194-4502</orcidid></search><sort><creationdate>20230601</creationdate><title>A Framework to Maximize Group Fairness for Workers on Online Labor Platforms</title><author>Rabaa, Anis El ; Elbassuoni, Shady ; Hanna, Jihad ; Mouawad, Amer E. ; Olleik, Ayham ; Amer-Yahia, Sihem</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c487t-b1cc81566ca68e2b0a00c6ef0b8fa6611dadc5e13c7a37b149c36b1b5a1bc7b53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithm Analysis and Problem Complexity</topic><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Chemistry and Earth Sciences</topic><topic>Computer engineering</topic><topic>Computer Science</topic><topic>Crowdsourcing</topic><topic>Data Mining and Knowledge Discovery</topic><topic>Database Management</topic><topic>Employment</topic><topic>Group fairness</topic><topic>Job hunting</topic><topic>Job provider</topic><topic>Job seeker</topic><topic>Labor</topic><topic>Matching</topic><topic>Online labor platforms</topic><topic>Optimization</topic><topic>Physics</topic><topic>Platforms</topic><topic>Research Paper</topic><topic>Statistics for Engineering</topic><topic>Synthetic data</topic><topic>Systems and Data Security</topic><topic>Workers</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rabaa, Anis El</creatorcontrib><creatorcontrib>Elbassuoni, Shady</creatorcontrib><creatorcontrib>Hanna, Jihad</creatorcontrib><creatorcontrib>Mouawad, Amer E.</creatorcontrib><creatorcontrib>Olleik, Ayham</creatorcontrib><creatorcontrib>Amer-Yahia, Sihem</creatorcontrib><collection>SpringerOpen</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>Data science and engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rabaa, Anis El</au><au>Elbassuoni, Shady</au><au>Hanna, Jihad</au><au>Mouawad, Amer E.</au><au>Olleik, Ayham</au><au>Amer-Yahia, Sihem</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Framework to Maximize Group Fairness for Workers on Online Labor Platforms</atitle><jtitle>Data science and engineering</jtitle><stitle>Data Sci. Eng</stitle><date>2023-06-01</date><risdate>2023</risdate><volume>8</volume><issue>2</issue><spage>146</spage><epage>176</epage><pages>146-176</pages><issn>2364-1185</issn><eissn>2364-1541</eissn><abstract>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.</abstract><cop>Singapore</cop><pub>Springer Nature Singapore</pub><doi>10.1007/s41019-023-00213-y</doi><tpages>31</tpages><orcidid>https://orcid.org/0000-0002-3491-6311</orcidid><orcidid>https://orcid.org/0000-0002-6194-4502</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2364-1185
ispartof Data science and engineering, 2023-06, Vol.8 (2), p.146-176
issn 2364-1185
2364-1541
language eng
recordid cdi_doaj_primary_oai_doaj_org_article_7f0e12564d1041d1882132c84b50acb2
source Springer Nature - SpringerLink Journals - Fully Open Access ; Publicly Available Content (ProQuest)
subjects Algorithm Analysis and Problem Complexity
Algorithms
Artificial Intelligence
Chemistry and Earth Sciences
Computer engineering
Computer Science
Crowdsourcing
Data Mining and Knowledge Discovery
Database Management
Employment
Group fairness
Job hunting
Job provider
Job seeker
Labor
Matching
Online labor platforms
Optimization
Physics
Platforms
Research Paper
Statistics for Engineering
Synthetic data
Systems and Data Security
Workers
title A Framework to Maximize Group Fairness for Workers on Online Labor Platforms
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T20%3A10%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_doaj_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Framework%20to%20Maximize%20Group%20Fairness%20for%20Workers%20on%20Online%20Labor%20Platforms&rft.jtitle=Data%20science%20and%20engineering&rft.au=Rabaa,%20Anis%20El&rft.date=2023-06-01&rft.volume=8&rft.issue=2&rft.spage=146&rft.epage=176&rft.pages=146-176&rft.issn=2364-1185&rft.eissn=2364-1541&rft_id=info:doi/10.1007/s41019-023-00213-y&rft_dat=%3Cproquest_doaj_%3E2890355957%3C/proquest_doaj_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c487t-b1cc81566ca68e2b0a00c6ef0b8fa6611dadc5e13c7a37b149c36b1b5a1bc7b53%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2890355957&rft_id=info:pmid/&rfr_iscdi=true