{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:01:48Z","timestamp":1743138108640,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030594152"},{"type":"electronic","value":"9783030594169"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59416-9_45","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T16:08:14Z","timestamp":1600704494000},"page":"694-710","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finish Them on the Fly: An Incentive Mechanism for Real-Time Spatial Crowdsourcing"],"prefix":"10.1007","author":[{"given":"Qiyu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Libin","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Yanyan","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"45_CR1","unstructured":"Amazon mechanical turk. https:\/\/www.mturk.com\/. Accessed 11 Nov 2019"},{"key":"45_CR2","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"2005","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (2005)"},{"key":"45_CR3","unstructured":"Faradani, S., Hartmann, B., Ipeirotis, P.G.: What\u2019s the right price? Pricing tasks for finishing on time. In: AAAI Workshops Human Computation, vol. WS-11-11. AAAI (2011)"},{"issue":"11","key":"45_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MCOM.2011.6069707","volume":"49","author":"RK Ganti","year":"2011","unstructured":"Ganti, R.K., Ye, F., Lei, H.: Mobile crowdsensing: current state and future challenges. IEEE Commun. Mag. 49(11), 32\u201339 (2011)","journal-title":"IEEE Commun. Mag."},{"issue":"14","key":"45_CR5","first-page":"1965","volume":"7","author":"Y Gao","year":"2014","unstructured":"Gao, Y., Parameswaran, A.G.: Finish them!: pricing algorithms for human computation. PVLDB 7(14), 1965\u20131976 (2014)","journal-title":"PVLDB"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-24777-7_11","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: The multiple-choice knapsack problem. In: Kellerer, H., Pferschy, U., Pisinger, D. (eds.) Knapsack Problems, pp. 317\u2013347. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_11"},{"key":"45_CR7","unstructured":"Kleinberg, R.D.: A multiple-choice secretary algorithm with applications to online auctions. In: SODA, pp. 630\u2013631. SIAM (2005)"},{"key":"45_CR8","first-page":"73","volume":"68","author":"A Marchetti-Spaccamela","year":"1995","unstructured":"Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line Knapsack problems. Math. Program. 68, 73\u2013104 (1995)","journal-title":"Math. Program."},{"key":"45_CR9","unstructured":"McFadden, D., et al.: Conditional logit analysis of qualitative choice behavior (1973)"},{"key":"45_CR10","unstructured":"Singer, Y., Mittal, M.: Pricing tasks in online labor markets. In: AAAI Workshops Human Computation, vol. WS-11-11. AAAI (2011)"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Singla, A., Krause, A.: Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In: WWW, pp. 1167\u20131178. International World Wide Web Conferences Steering Committee\/ACM (2013)","DOI":"10.1145\/2488388.2488490"},{"issue":"12","key":"45_CR12","first-page":"1988","volume":"10","author":"Y Tong","year":"2017","unstructured":"Tong, Y., Chen, L., Shahabi, C.: Spatial crowdsourcing: challenges, techniques, and applications. PVLDB 10(12), 1988\u20131991 (2017)","journal-title":"PVLDB"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Tong, Y., Wang, L., Zhou, Z., Chen, L., Du, B., Ye, J.: Dynamic pricing in spatial crowdsourcing: a matching-based approach. In: SIGMOD Conference, pp. 773\u2013788. ACM (2018)","DOI":"10.1145\/3183713.3196929"},{"issue":"1","key":"45_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00778-019-00568-7","volume":"29","author":"Y Tong","year":"2019","unstructured":"Tong, Y., Zhou, Z., Zeng, Y., Chen, L., Shahabi, C.: Spatial crowdsourcing: a survey. VLDB J. 29(1), 217\u2013250 (2019). https:\/\/doi.org\/10.1007\/s00778-019-00568-7","journal-title":"VLDB J."},{"key":"45_CR15","doi-asserted-by":"crossref","unstructured":"Xia, J., Zhao, Y., Liu, G., Xu, J., Zhang, M., Zheng, K.: Profit-driven task assignment in spatial crowdsourcing. In: IJCAI, pp. 1914\u20131920. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/265"},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Yang, D., Xue, G., Fang, X., Tang, J.: Crowdsourcing to smartphones: incentive mechanism design for mobile phone sensing. In: MobiCom, pp. 173\u2013184. ACM (2012)","DOI":"10.1145\/2348543.2348567"},{"issue":"5","key":"45_CR17","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1007\/s11280-018-0638-2","volume":"22","author":"D Zhai","year":"2018","unstructured":"Zhai, D., et al.: Towards secure and truthful task assignment in spatial crowdsourcing. World Wide Web 22(5), 2017\u20132040 (2018). https:\/\/doi.org\/10.1007\/s11280-018-0638-2","journal-title":"World Wide Web"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Chakrabarty, D., Lukose, R.M.: Budget constrained bidding in keyword auctions and online knapsack problems. In: WWW, pp. 1243\u20131244. ACM (2008)","DOI":"10.1145\/1367497.1367747"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59416-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:38:21Z","timestamp":1709811501000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59416-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030594152","9783030594169"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59416-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/db.pknu.ac.kr\/dasfaa2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"487","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.81","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 demo papers and 4 industrial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}