Dynamic task assignment in spatial crowdsourcing
作者： Yongxin Tong , Zimu Zhou
关键词: Point (typography) 、 Urban services 、 Thesaurus (information retrieval) 、 Data science 、 Mobile computing 、 Computer science 、 Task (project management) 、 Crowdsourcing
摘要: Spatial crowdsourcing is a crowdsourcing paradigm featured with spatiotemporal information of tasks and workers. It has been widely adopted in mobile computing applications and …
acm.org
sci-hub.se 参考文章(33)
Ran El-Yaniv, Allan Borodin, Online Computation and Competitive Analysis ,(1998)
Lei Chen, Dongwon Lee, Tova Milo, Data-driven crowdsourcing: Management, mining, and applications international conference on data engineering. pp. 1527- 1529 ,(2015) , 10.1109/ICDE.2015.7113418
B. Kalyanasundaram, K. Pruhs, Online weighted matching Journal of Algorithms. ,vol. 14, pp. 478- 488 ,(1993) , 10.1006/JAGM.1993.1026
Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor, A randomized O ( log^2 k )-competitive algorithm for metric bipartite matching Algorithmica. ,vol. 68, pp. 390- 403 ,(2014) , 10.1007/S00453-012-9676-9
Leyla Kazemi, Cyrus Shahabi, Lei Chen, GeoTruCrowd: trustworthy query answering with spatial crowdsourcing advances in geographic information systems. pp. 314- 323 ,(2013) , 10.1145/2525314.2525346
Mohamed Musthag, Deepak Ganesan, Labor dynamics in a mobile micro-task market human factors in computing systems. pp. 641- 650 ,(2013) , 10.1145/2470654.2470745
Leyla Kazemi, Cyrus Shahabi, GeoCrowd Proceedings of the 20th International Conference on Advances in Geographic Information Systems - SIGSPATIAL '12. pp. 189- 198 ,(2012) , 10.1145/2424321.2424346
Laura Poplawski, Adam Meyerson, Akash Nanavati, Randomized online algorithms for minimum metric bipartite matching symposium on discrete algorithms. pp. 954- 959 ,(2006) , 10.5555/1109557.1109662
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar, A tight bound on approximating arbitrary metrics by tree metrics symposium on the theory of computing. ,vol. 69, pp. 448- 455 ,(2003) , 10.1145/780542.780608
Jon Feldman, Aranyak Mehta, Vahab Mirrokni, S. Muthukrishnan, Online Stochastic Matching: Beating 1-1/e 2009 50th Annual IEEE Symposium on Foundations of Computer Science. pp. 117- 126 ,(2009) , 10.1109/FOCS.2009.72