MAHCJul 9, 2018

Fair Task Allocation in Crowdsourced Delivery

arXiv:1807.02987v159 citations
Originality Incremental advance
AI Analysis

This work addresses fairness in task allocation for crowdsourced delivery systems, which is crucial for maintaining high worker participation, though it appears incremental as it builds on existing assignment solutions by incorporating dynamic fairness metrics.

The paper tackles the problem of fair task allocation in crowdsourced delivery by introducing a new assignment strategy that considers fairness towards workers while maximizing task allocation ratio, achieving 96.9% allocation compared to the optimal solution and running 10^7 times faster.

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 a given task. To realize the effectiveness of our model in practice, we present both offline and online versions of our proposed algorithm called F-Aware. Given a task-to-worker bipartite graph, F-Aware assigns each task to a worker that minimizes unfairness, while allocating tasks to use worker capacities as much as possible. We present an evaluation of our algorithms with respect to running time, task allocation ratio (TAR), as well as unfairness and assignment ratio. Experiments show that F-Aware runs around 10^7 x faster than the TAR-optimal solution and allocates 96.9% of the tasks that can be allocated by it. Moreover, it is shown that, F-Aware is able to provide a much fair distribution of tasks to workers than the best competitor algorithm.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes