A task allocation algorithm based on reinforcement learning in spatio-temporal crowdsourcing

With the pervasiveness of dynamic task allocation in sharing economy applications, online bipartite graph matching has attracted more and more research attention. In sharing economy applications, crowdsourcing platforms need to allocate tasks to workers dynamically. Previous studies have low allocation utility. To increase the allocation utility of the Spatio-temporal crowdsourcing system, this paper proposes a dynamic delay bipartite matching(DDBM) problem, and designs Value Based Task Allocation(VBTA) and Policy Gradient Based Task Allocation(PGTA) frameworks respectively. According to the current state, VBTA and PGTA could enhance the allocation utility by selecting appropriate thresholds. The convergence of the algorithm is proved. Extensive experimental results on two real datasets demonstrate that the proposed algorithms are superior to the existing algorithms in effectiveness and efficiency.

Automated summary

With the widespread use of dynamic task allocation in sharing economy applications, online bipartite graph matching has become a focus of research. This paper proposes a dynamic delay bipartite matching (DDBM) problem and designs two task allocation frameworks to increase allocation utility.