{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:02:40Z","timestamp":1768071760184,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,25]],"date-time":"2019-07-25T00:00:00Z","timestamp":1564012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,25]]},"DOI":"10.1145\/3292500.3330879","type":"proceedings-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T13:17:26Z","timestamp":1564147046000},"page":"1643-1653","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":26,"title":["Three-Dimensional Stable Matching Problem for Spatial Crowdsourcing Platforms"],"prefix":"10.1145","author":[{"given":"Boyang","family":"Li","sequence":"first","affiliation":[{"name":"Northeastern University, Shenyang, China"}]},{"given":"Yurong","family":"Cheng","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}]},{"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, 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, China"}]}],"member":"320","published-online":{"date-parts":[[2019,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"A New Approach to Stable Matching Problems","author":"Ashok S.","unstructured":"S. Ashok . 1994. A New Approach to Stable Matching Problems . Society for Industrial and Applied Mathematics . 671--701 pages. S. Ashok. 1994. A New Approach to Stable Matching Problems .Society for Industrial and Applied Mathematics. 671--701 pages."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00203-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733047"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236196"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2550041"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794372"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Y. Cheng Y. Yuan L. Chen C. G. Giraud-Carrier and G. Wang. 2017. Complex Event-Participant Planning and Its Incremental Variant. In ICDE. 859--870.  Y. Cheng Y. Yuan L. Chen C. G. Giraud-Carrier and G. Wang. 2017. Complex Event-Participant Planning and Its Incremental Variant. In ICDE. 859--870.","DOI":"10.1109\/ICDE.2017.135"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2651491.2651817"},{"key":"e_1_3_2_1_9_1","volume-title":"Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms","author":"Ervin K. D.","unstructured":"K. D. Ervin . 1997. Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms . Vol. 10 . American Mathematical Soc . K. D. Ervin. 1997. Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Vol. 10. American Mathematical Soc."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4169\/amer.math.monthly.120.05.386"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90074-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-017-0037-1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/UIC-ATC-ScalCom.2014.68"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"H. Jiang C.-M. Li Y. Liu and F. Many\u00e0. 2018. A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. In AAAI.  H. Jiang C.-M. Li Y. Liu and F. Many\u00e0. 2018. A Two-Stage MaxSAT Reasoning Approach for the Maximum Weight Clique Problem. In AAAI.","DOI":"10.1609\/aaai.v32i1.11527"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"H. Jiang C.-M. Li and F. Many\u00e0. 2017. An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. In AAAI.   H. Jiang C.-M. Li and F. Many\u00e0. 2017. An Exact Algorithm for the Maximum Weight Clique Problem in Large Graphs. In AAAI.","DOI":"10.1609\/aaai.v31i1.10648"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424346"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525346"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2006.03.005"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1033081"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339693"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2470654.2470745"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404023"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00182-008-0117-6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064020"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"T. Song Y. Tong L. Wang J. She B. Yao L. Chen and K. Xu. 2017. Trichromatic Online Matching in Real-Time Spatial Crowdsourcing. In ICDE. 1009--1020.  T. Song Y. Tong L. Wang J. She B. Yao L. Chen and K. Xu. 2017. Trichromatic Online Matching in Real-Time Spatial Crowdsourcing. In ICDE. 1009--1020.","DOI":"10.1109\/ICDE.2017.147"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"T. Song F. Zhu and K. Xu. 2018. Specialty-Aware Task Assignment in Spatial Crowdsourcing. In AISC. 243--254.  T. Song F. Zhu and K. Xu. 2018. Specialty-Aware Task Assignment in Spatial Crowdsourcing. In AISC. 243--254.","DOI":"10.1007\/978-3-319-99957-9_19"},{"key":"e_1_3_2_1_27_1","volume-title":"Trojanowski","author":"Tarjan Robert E","year":"1977","unstructured":"Robert E Tarjan and Anthony E . Trojanowski . 1977 . Finding a maximum independent set .Stanford University . 537--546 pages. Robert E Tarjan and Anthony E. Trojanowski. 1977. Finding a maximum independent set .Stanford University. 537--546 pages."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2729713"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Y. Tong J. She B. Ding L. Wang and L. Chen. 2016b. Online mobile Micro-Task Allocation in spatial crowdsourcing. In ICDE. 49--60.  Y. Tong J. She B. Ding L. Wang and L. Chen. 2016b. Online mobile Micro-Task Allocation in spatial crowdsourcing. In ICDE. 49--60.","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137643"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292390.3292395"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3078853"}],"event":{"name":"KDD '19: The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Anchorage AK USA","acronym":"KDD '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330879","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3292500.3330879","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:03Z","timestamp":1750206363000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3292500.3330879"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,25]]},"references-count":33,"alternative-id":["10.1145\/3292500.3330879","10.1145\/3292500"],"URL":"https:\/\/doi.org\/10.1145\/3292500.3330879","relation":{},"subject":[],"published":{"date-parts":[[2019,7,25]]},"assertion":[{"value":"2019-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}