{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:42:58Z","timestamp":1765546978362},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:p>With the continuous development of spatial crowdsourcing platform, online task assignment problem has been widely studied as a typical problem in spatial crowdsourcing. Most of the existing studies are based on a single-platform task assignment to maximize the platform's revenue. Recently, cross online task assignment has been proposed, aiming at increasing the mutual benefit through cooperations. However, existing methods fail to consider the data privacy protection in the process of cooperation and cause the leakage of sensitive data such as the location of a request and the historical data of cooperative platforms. In this paper, we propose Privacy-preserving Cooperative Online Matching (PCOM), which protects the privacy of the users and workers on their respective platforms. We design a PCOM framework and provide theoretical proof that the framework satisfies the differential privacy property. We then propose two PCOM algorithms based on two different privacy-preserving strategies. Extensive experiments on real and synthetic datasets confirm the effectiveness and efficiency of our algorithms.<\/jats:p>","DOI":"10.14778\/3561261.3561266","type":"journal-article","created":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T15:32:50Z","timestamp":1668612770000},"page":"51-63","source":"Crossref","is-referenced-by-count":16,"title":["Privacy-preserving cooperative online matching over spatial crowdsourcing platforms"],"prefix":"10.14778","volume":"16","author":[{"given":"Yi","family":"Yang","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}]},{"given":"Yurong","family":"Cheng","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}]},{"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong SAR, China"}]},{"given":"Yongjiao","family":"Sun","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]}],"member":"320","published-online":{"date-parts":[[2022,11,16]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2022. DataSet. https:\/\/github.com\/Yi107\/Dataset-for-PCOM.git.  2022. DataSet. https:\/\/github.com\/Yi107\/Dataset-for-PCOM.git."},{"key":"e_1_2_1_2_1","unstructured":"2022. DiDi. https:\/\/www.didiglobal.com\/.  2022. DiDi. https:\/\/www.didiglobal.com\/."},{"key":"e_1_2_1_3_1","unstructured":"2022. Meituan. https:\/\/waimai.meituan.com.  2022. Meituan. https:\/\/waimai.meituan.com."},{"key":"e_1_2_1_4_1","unstructured":"2022. Uber. https:\/\/www.uber.com\/.  2022. Uber. https:\/\/www.uber.com\/."},{"key":"e_1_2_1_5_1","unstructured":"2022. Uber Eats. https:\/\/www.ele.me\/.  2022. Uber Eats. https:\/\/www.ele.me\/."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.95"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516735"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2996913.2996974"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186924"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00008"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.16"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018","author":"Dickerson John P.","year":"2018","unstructured":"John P. Dickerson , Karthik Abinav Sankararaman , Aravind Srinivasan , and Pan Xu . 2018 . Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals . In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018 , Stockholm, Sweden, July 10--15 , 2018, Elisabeth Andr\u00e9, Sven Koenig, Mehdi Dastani, and Gita Sukthankar (Eds.). International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA \/ ACM, 318--326. http:\/\/dl.acm.org\/citation.cfm?id=3237435 John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu. 2018. Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals. In Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10--15, 2018, Elisabeth Andr\u00e9, Sven Koenig, Mehdi Dastani, and Gita Sukthankar (Eds.). International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA \/ ACM, 318--326. http:\/\/dl.acm.org\/citation.cfm?id=3237435"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2013.0621"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2031331.2031337"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.41"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00051"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.032"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732966"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00080"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00261"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196929"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137643"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00568-7"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_87"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3561261.3561266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:20:19Z","timestamp":1672219219000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3561261.3561266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["10.14778\/3561261.3561266"],"URL":"https:\/\/doi.org\/10.14778\/3561261.3561266","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2022,9]]}}}