{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:22:54Z","timestamp":1743052974946,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185787"},{"type":"electronic","value":"9783030185794"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18579-4_39","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T15:05:36Z","timestamp":1556031936000},"page":"660-677","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reverse-Auction-Based Competitive Order Assignment for Mobile Taxi-Hailing Systems"],"prefix":"10.1007","author":[{"given":"Hui","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Mingjun","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Jie","family":"Wu","sequence":"additional","affiliation":[]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Baoyi","family":"An","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"39_CR1","unstructured":"Nyc taxi trips (2016). http:\/\/www.nyc.gov\/html\/tlc\/html\/about\/trip_record_data.shtml"},{"key":"39_CR2","unstructured":"DMR, January 8. https:\/\/expandedramblings.com\/index.php\/uber-statistics\/"},{"issue":"4","key":"39_CR3","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.2307\/1427934","volume":"27","author":"R Agrawal","year":"1995","unstructured":"Agrawal, R.: Sample mean based index policies by $$o(\\log n)$$ regret for the multi-armed bandit problem. Adv. Appl. Probab. 27(4), 1054\u20131078 (1995)","journal-title":"Adv. Appl. Probab."},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Asghari, M., Deng, D., Shahabi, C., Demiryurek, U., Li, Y.: Price-aware real-time ride-sharing at scale: an auction-based approach. In: ACM SIGSPATIAL (2016)","DOI":"10.1145\/2996913.2996974"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Asghari, M., Shahabi, C.: An on-line truthful and individually rational pricing mechanism for ride-sharing. In: ACM SIGSPATIAL (2017)","DOI":"10.1145\/3139958.3139991"},{"issue":"2\u20133","key":"39_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Chen, L., Zhong, Q., Xiao, X., Gao, Y., Jin, P., Jensen, C.S.: Price-and-time-aware dynamic ridesharing. In: IEEE ICDE (2018)","DOI":"10.1109\/ICDE.2018.00099"},{"issue":"12","key":"39_CR8","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.14778\/3229863.3236229","volume":"11","author":"L Chen","year":"2018","unstructured":"Chen, L., Gao, Y., Liu, Z., Xiao, X., Jensen, C.S., Zhu, Y.: PTrider: a price-and-time-aware ridesharing system. Proc. VLDB Endow. 11(12), 1938\u20131941 (2018)","journal-title":"Proc. VLDB Endow."},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Gao, G., Xiao, M., Zhao, Z.: Optimal multi-taxi dispatch for mobile taxi-hailing systems. In: ICPP (2016)","DOI":"10.1109\/ICPP.2016.41"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Garg, N., Ranu, S.: Route recommendations for idle taxi drivers: find me the shortest route to a customer! In: ACM SIGKDD (2018)","DOI":"10.1145\/3219819.3220055"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Kang, S., Joo, C.: Low-complexity learning for dynamic spectrum access in multi-user multi-channel networks. In: IEEE INFOCOM (2018)","DOI":"10.1109\/INFOCOM.2018.8485937"},{"issue":"1\u20132","key":"39_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics (NRL) 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"1","key":"39_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/0196-8858(85)90002-8","volume":"6","author":"TL Lai","year":"1985","unstructured":"Lai, T.L., Robbins, H.: Asymptotically efficient adaptive allocation rules. Adv. Appl. Math. 6(1), 4\u201322 (1985)","journal-title":"Adv. Appl. Math."},{"issue":"5","key":"39_CR14","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s11390-017-1772-5","volume":"32","author":"A Liu","year":"2017","unstructured":"Liu, A., et al.: Privacy-preserving task assignment in spatial crowdsourcing. J. Comput. Sci. Technol. 32(5), 905\u2013918 (2017)","journal-title":"J. Comput. Sci. Technol."},{"issue":"2","key":"39_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10707-017-0305-2","volume":"22","author":"A Liu","year":"2018","unstructured":"Liu, A., Wang, W., Shang, S., Li, Q., Zhang, X.: Efficient task assignment in spatial crowdsourcing with worker and task privacy protection. GeoInformatica 22(2), 335\u2013362 (2018)","journal-title":"GeoInformatica"},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"39_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, New York (2007)"},{"key":"39_CR18","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: ACM SIGMOD (2018)","DOI":"10.1145\/3183713.3196929"},{"key":"39_CR19","first-page":"89","volume":"214","author":"L Tran-Thanh","year":"2014","unstructured":"Tran-Thanh, L., Stein, S., Rogers, A., Jennings, N.R.: Efficient crowdsourcing of unknown experts using bounded multi-armed bandits. AI 214, 89\u2013111 (2014)","journal-title":"AI"},{"key":"39_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/11564096_42","volume-title":"Machine Learning: ECML 2005","author":"J Vermorel","year":"2005","unstructured":"Vermorel, J., Mohri, M.: Multi-armed bandit algorithms and empirical evaluation. In: Gama, J., Camacho, R., Brazdil, P.B., Jorge, A.M., Torgo, L. (eds.) ECML 2005. LNCS (LNAI), vol. 3720, pp. 437\u2013448. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564096_42"},{"key":"39_CR21","unstructured":"Xiao, M., et al.: SRA: secure reverse auction for task assignment in spatial crowdsourcing. In: IEEE TKDE, p. 1 (2019)"},{"issue":"8","key":"39_CR22","doi-asserted-by":"publisher","first-page":"2306","DOI":"10.1109\/TMC.2016.2616473","volume":"16","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Wu, J., Huang, L., Cheng, R., Wang, Y.: Online task assignment for crowdsensing in predictable mobile social networks. IEEE Trans. Mob. Comput. 16(8), 2306\u20132320 (2017)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Zheng, H., Wu, J.: Online to offline business: urban taxi dispatching with passenger-driver matching stability. In: IEEE ICDCS (2017)","DOI":"10.1109\/ICDCS.2017.14"}],"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-18579-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T08:54:49Z","timestamp":1710233689000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18579-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185787","9783030185794"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18579-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","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":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","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":"92","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":"64","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":"18% - 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","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":"3","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":"13 demo papers, 6 tutorial 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)"}}]}}