Abstract
Spatial crowdsourcing (SC) services become very popular. And one basic problem in SC is how to appropriately assign tasks to workers for better user experience. Most of existing researches focus on utilitarian optimization objectives for the benefit of the platform, such as maximizing the number of performed tasks, maximizing the total utility of the assignment, and minimizing the total cost to perform all tasks. However, users (i.e., task-requesters and workers) usually only care about their own cost (i.e., each user hopes his/her cost in the assignment to be small) instead of such those utilitarian optimization objectives. From the perspective of users, we propose an egalitarian version of online task assignment problem in SC, namely Minimizing Bottleneck with Time-Delay in Spatial Crowdsourcing (MBTD-SC). We further devise a heuristic algorithm to solve it. Finally, we validate the effectiveness of the proposed algorithm on both synthetic and real datasets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Anthony, B.M., Chung, C.: Online bottleneck matching. Journal of Combinatorial Optimization 27(1), 100–114 (2014)
Anthony, B.M., Chung, C.: Serve or skip: the power of rejection in online bottleneck matching. Journal of Combinatorial Optimization 32(4), 1232–1253 (2016)
Gross, O.: The bottleneck assignment problem. Tech. rep, RAND CORP SANTA MONICA CALIF (1959)
Long, C., Wong, R.C.W., Yu, P.S., Jiang, M.: On optimal worst-case matching. In: SIGMOD. pp. 845–856 (2013)
Song, T., Tong, Y., Wang, L., She, J., Yao, B., Chen, L., Xu, K.: Trichromatic online matching in real-time spatial crowdsourcing. In: ICDE. pp. 1009–1020 (2017)
Tong, Y., Chen, L., Shahabi, C.: Spatial crowdsourcing: Challenges, techniques, and applications. PVLDB 10(12), 1988–1991 (2017)
Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. PVLDB 9(12), 1053–1064 (2016)
Tong, Y., She, J., Ding, B., Wang, L., Chen, L.: Online mobile micro-task allocation in spatial crowdsourcing. In: ICDE. pp. 49–60 (2016)
Tong, Y., Wang, L., Zhou, Z., Chen, L., Du, B., Ye, J.: Dynamic pricing in spatial crowdsourcing: A matching-based approach. In: SIGMOD. pp. 773–788 (2018)
Tong, Y., Wang, L., Zhou, Z., Ding, B., Chen, L., Ye, J., Xu, K.: Flexible online task assignment in real-time spatial data. PVLDB 10(11), 1334–1345 (2017)
Tong, Y., Zeng, Y., Zhou, Z., Chen, L., Ye, J., Xu, K.: A unified approach to route planning for shared mobility. PVLDB 11(11), 1633–1646 (2018)
Zeng, Y., Tong, Y., Chen, L., Zhou, Z.: Latency-oriented task completion via spatial crowdsourcing. In: ICDE. pp. 317–328 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, L., Fang, J., Du, B., Lv, W. (2019). Spatial Bottleneck Minimum Task Assignment with Time-Delay. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11448. Springer, Cham. https://doi.org/10.1007/978-3-030-18590-9_51
Download citation
DOI: https://doi.org/10.1007/978-3-030-18590-9_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18589-3
Online ISBN: 978-3-030-18590-9
eBook Packages: Computer ScienceComputer Science (R0)