Fair Task Allocation in Crowdsourced Delivery
Fuat Basik, Bugra Gedik, Hakan Ferhatosmanoglu, Kun-Lung Wu

TL;DR
This paper introduces F-Aware, a novel algorithm for crowdsourced delivery that balances fairness to workers with maximizing task allocation, significantly improving efficiency and fairness over existing methods.
Contribution
The paper presents a new 2-phase allocation model and the F-Aware algorithm, which incorporate fairness into task assignment for crowdsourced delivery, addressing limitations of previous solutions.
Findings
F-Aware runs around 10^7 times faster than TAR-optimal solutions.
F-Aware allocates 96.9% of possible tasks, demonstrating high efficiency.
F-Aware provides a more fair distribution of tasks compared to competitors.
Abstract
Faster and more cost-efficient, crowdsourced delivery is needed to meet the growing customer demands of many industries, including online shopping, on-demand local delivery, and on-demand transportation. The power of crowdsourced delivery stems from the large number of workers potentially available to provide services and reduce costs. It has been shown in social psychology literature that fairness is key to ensuring high worker participation. However, existing assignment solutions fall short on modeling the dynamic fairness metric. In this work, we introduce a new assignment strategy for crowdsourced delivery tasks. This strategy takes fairness towards workers into consideration, while maximizing the task allocation ratio. Since redundant assignments are not possible in delivery tasks, we first introduce a 2-phase allocation model that increases the reliability of a worker to complete…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
