Abstract
Task assignment, the core problem of Spatial Crowdsourcing (SC), is often modeled as an optimization problem with multiple constraints, and the quality and efficiency of its solution determines how well the SC system works. Fairness is a critical aspect of task assignment that affects worker participation and satisfaction. Although the existing studies on SC have noticed the fairness problem, they mainly focus on fairness at the individual level rather than at the group level. However, differences among groups in certain attributes (e.g. race, gender, age) can easily lead to discrimination in task assignment, which triggers ethical issues and even deteriorates the quality of the SC system. Therefore, we study the problem of task assignment with group fairness for SC. According to the principle of fair budget allocation, we define a well-designed constraint that can be considered in the task assignment problem of SC systems, resulting in assignment with group fairness. We mainly consider the task assignment problem in a common One-to-One SC system (O2-SC), and our goal is to maximize the quality of the task assignment while satisfying group fairness and other constraints such as budget and spatial constraints. Specifically, we first give the formal definition of task assignment with group fairness constraint for O2-SC. Then, we prove that it is essentially an NP-hard combinatorial optimization problem. Next, we provide a novel fast algorithm with theoretical guarantees to solve it. Finally, we conduct extensive experiments using both synthetic and real datasets. The experimental results show that the proposed constraint can significantly improve the group fairness level of algorithms, even for a completely random algorithm. The results also show that our algorithm can efficiently and effectively complete the task assignment of SC systems while ensuring group fairness.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.