[1] CHENG P, JIAN X, CHEN L. Task assignment on spatial crowdsourcing[R/OL].[2017-05-02]. http://arxiv.org/pdf/1605.09675. [2] KITTUR A, CHI E H, SUH B. Crowdsourcing user studies with Mechanical Turk[C]//CHI'08:Proceedings of the 2008 SIGCHI Conference on Human Factors in Computing Systems. New York:ACM, 2008:453-456. [3] CORMEN T H, LEISERSON C E, RIVEST R, et al. Introduction to Algorithms[M]. Cambridge, MA:MIT Press, 2009:118. [4] LEONG HOU U, MAN LUNG YIU, MOURATIDIS K, et al. Capacity constrained assignment in spatial databases[C]//SIGMOD'08:Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. New York:ACM, 2008:15-28. [5] WONG R C-W, TAO Y, FU A W-C, et al. On efficient spatial matching[C]//VLDB'07:Proceedings of the 33rd International Conference on Very large Data Bases. New York:ACM, 2007:579-590. [6] LONG C, WONG R C-W, YU P S, et al. On optimal worst-case matching[C]//SIGMOD'13:Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. New York:ACM, 2013:845-856. [7] TONG Y, SHE J, DING B, et al. Online mobile micro-task allocation in spatial crowdsourcing[C]//ICDE 2016:Proceedings of the 2016 IEEE 32nd International Conference on Data Engineering. Piscataway, NJ:IEEE, 2016:49-60. [8] LEONG HOU U, MOURATIDIS K, MAMOULIS N. Continuous spatial assignment of moving users[J]. The VLDB Journal-The International Journal on Very Large Data Bases, 2010, 19(2):141-160. [9] GAREY M R, JOHNSON D S. Computers and Intractability:A Guide to the Theory of NP-completeness[M]. New York:W. H. Freeman, 1979:90-91. [10] MEHTA A. Online matching and ad allocation[J]. Foundations & Trends in Theoretical Computer Science, 2013, 8(4):265-368. [11] WANG Y, WONG S C-W. Two-sided online bipartite matching and vertex cover:beating the greedy algorithm[C]//ICALP 2015:Proceedings of the 2015 International Colloquium on Automata, Languages, and Programming, LNCS 9134. Berlin:Springer, 2015:1070-1081. [12] TING H F, XIANG X. Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching[J]. Theoretical Computer Science, 2015, 607(P2):247-256. [13] HASSAN U U, CURRY E. A multi-armed bandit approach to online spatial task assignment[C]//UIC-ATC-ScalCom'14:Proceedings of the 2014 IEEE 11th International Conference on Ubiquitous Intelligence and Computing, and 2014 IEEE 11th International Conference on Autonomic and Trusted Computing, and 2014 IEEE 14th International Conference on Scalable Computing and Communications and Its Associated Workshops. Washington, DC:IEEE Computer Society, 2014:212-219. [14] 宋天舒,童咏昕.空间众包环境下的三类对象在线任务分配[J].软件学报,2017,28(3):611-630. (SONG T S, TONG Y X. Three types of objects online task allocation space crowdsourcing environment.[J] Journal of Software, 2017, 28(3):611-630.) [15] REN J, ZHANG Y, ZHANG K, et al. SACRM:Social Aware Crowdsourcing with Reputation Management in mobile sensing[J]. Computer Communications, 2014, 65:55-65. [16] DAI W, WANG Y, JIN Q, et al. An integrated incentive framework for mobile crowdsourced sensing[J]. Tsinghua Science and Technology, 2016, 21(2):146-156. [17] 张晓航,李国良,冯建华.大数据群体计算中用户主题感知的任务分配[J].计算机研究与发展,2015,52(2):309-317. (ZHANG X H, LI G L, FENG J H. User topic aware task assignment in large data group computing[J]. Journal of Computer Research and Development, 2015, 52(2):309-317). [18] CHEN Z, FU R, ZHAO Z, et al. gMission:a general spatial crowdsourcing platform[J]. Proceedings of the Very Large Data Base Endowment, 2014, 7(13):1629-1632. |