{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:05:10Z","timestamp":1775815510814,"version":"3.50.1"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["CNS 1010789 and CCF 1422569"],"award-info":[{"award-number":["CNS 1010789 and CCF 1422569"]}]},{"name":"NSF CRII","award":["IIS-1948157"],"award-info":[{"award-number":["IIS-1948157"]}]},{"name":"NSF","award":["CNS-1010789, CCF-1422569, CCF-1749864, CCF-1918749"],"award-info":[{"award-number":["CNS-1010789, CCF-1422569, CCF-1749864, CCF-1918749"]}]},{"name":"NSF CAREER","award":["IIS-1846237"],"award-info":[{"award-number":["IIS-1846237"]}]},{"name":"NIST MSE","award":["20126334"],"award-info":[{"award-number":["20126334"]}]},{"name":"DARPA GARD","award":["HR00112020007"],"award-info":[{"award-number":["HR00112020007"]}]},{"name":"DARPA SI3-CMD","award":["S4761"],"award-info":[{"award-number":["S4761"]}]},{"name":"DoD WHS","award":["HQ003420F0035"],"award-info":[{"award-number":["HQ003420F0035"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>\n            Efficient allocation of tasks to workers is a central problem in crowdsourcing. In this article, we consider a setting inspired by spatial crowdsourcing platforms, where both workers and tasks arrive at different times, and each worker-task assignment yields a given reward. The key challenge is to address the uncertainty in the stochastic arrivals from both workers and the tasks. In this work, we consider a ubiquitous scenario where the arrival patterns of worker \u201ctypes\u201d and task \u201ctypes\u201d are not erratic but can be predicted from historical data. Specifically, we consider a finite time horizon\n            <jats:italic>T<\/jats:italic>\n            and assume that in each time-step the arrival of a worker and a task can be seen as an independent sample from two (different) distributions.\n          <\/jats:p>\n          <jats:p>\n            Our model, called\n            <jats:italic>Online Task Assignment with Two-sided Arrival<\/jats:italic>\n            (OTA-TSA), is a significant generalization of the classical online task assignment problem when all the tasks are statically available. For the general case of OTA-TSA, we present an optimal non-adaptive algorithm (NADAP), which achieves a competitive ratio (CR) of at least 0.295. For a special case of OTA-TSA when the reward depends only on the worker type, we present two adaptive algorithms, which achieve CRs of at least 0.343 and 0.355, respectively. On the hardness side, we show that (1) no non-adaptive can achieve a CR larger than that of NADAP, establishing the optimality of NADAP among all non-adaptive algorithms; and (2) no (adaptive) algorithm can achieve a CR better than 0.581 (unconditionally) or 0.423 (conditionally on the benchmark linear program), respectively. All aforementioned negative results apply to even unweighted OTA-TSA when every assignment yields a uniform reward. At the heart of our analysis is a new technical tool, called\n            <jats:italic>two-stage birth-death process<\/jats:italic>\n            , which is a refined notion of the classical birth-death process. We believe it may be of independent interest. Finally, we perform extensive numerical experiments on a real-world rideshare dataset collected in Chicago and a synthetic dataset, and results demonstrate the effectiveness of our proposed algorithms in practice.\n          <\/jats:p>","DOI":"10.1145\/3652021","type":"journal-article","created":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T12:14:09Z","timestamp":1710159249000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Matching Tasks and Workers under Known Arrival Distributions: Online Task Assignment with Two-sided Arrivals"],"prefix":"10.1145","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2231-680X","authenticated-orcid":false,"given":"John P.","family":"Dickerson","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, College Park, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8569-5694","authenticated-orcid":false,"given":"Karthik","family":"Sankararaman","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, CA, Austin, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0062-3684","authenticated-orcid":false,"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, College Park USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6362-6727","authenticated-orcid":false,"given":"Pan","family":"Xu","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology, Newark, NJ, Newark USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9965-0086","authenticated-orcid":false,"given":"Yifan","family":"Xu","sequence":"additional","affiliation":[{"name":"Southeast University, Nanjing, Nanjing, Jiangsu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"key":"e_1_3_3_2_2","first-page":"1321","volume-title":"Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 3","author":"Anshelevich Elliot","year":"2012","unstructured":"Elliot Anshelevich, Meenal Chhabra, Matthew Gerrior, and Sanmay Das. 2012. On the social welfare of mechanisms for repeated batch matching. In Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems-Volume 3. 1321\u20131322."},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1145\/3391403.3399524","volume-title":"Proceedings of the 21st ACM Conference on Economics and Computation","author":"Aouad Ali","year":"2020","unstructured":"Ali Aouad and \u00d6mer Sarita\u00e7. 2020. Dynamic stochastic matching under limited time. In Proceedings of the 21st ACM Conference on Economics and Computation. 789\u2013790."},{"issue":"4","key":"e_1_3_3_4_2","first-page":"927","article-title":"On matching and thickness in heterogeneous dynamic markets","volume":"67","author":"Ashlagi Itai","year":"2019","unstructured":"Itai Ashlagi, Maximilien Burq, Patrick Jaillet, and Vahideh Manshadi. 2019. On matching and thickness in heterogeneous dynamic markets. Oper. Res. 67, 4 (2019), 927\u2013949.","journal-title":"Oper. Res."},{"key":"e_1_3_3_5_2","article-title":"Maximizing efficiency in dynamic matching markets","author":"Ashlagi Itai","year":"2018","unstructured":"Itai Ashlagi, Maximilien Burq, Patrick Jaillet, and Amin Saberi. 2018. Maximizing efficiency in dynamic matching markets. Retrieved from https:\/\/arXiv:1803.01285","journal-title":"R"},{"key":"e_1_3_3_6_2","first-page":"25","volume-title":"Proceedings of the ACM Conference on Economics and Computation","author":"Ashlagi Itai","year":"2013","unstructured":"Itai Ashlagi, Patrick Jaillet, and Vahideh H. Manshadi. 2013. Kidney exchange in dynamic sparse heterogenous pools. In Proceedings of the ACM Conference on Economics and Computation. 25\u201326."},{"key":"e_1_3_3_7_2","volume-title":"Proceedings of the 3rd AAAI Conference on Human Computation and Crowdsourcing","author":"Assadi Sepehr","year":"2015","unstructured":"Sepehr Assadi, Justin Hsu, and Shahin Jabbari. 2015. Online assignment of heterogeneous tasks in crowdsourcing markets. In Proceedings of the 3rd AAAI Conference on Human Computation and Crowdsourcing."},{"key":"e_1_3_3_8_2","volume-title":"Online Computation and Competitive Analysis","author":"Borodin Allan","year":"1998","unstructured":"Allan Borodin and Ran El-Yaniv. 1998. Online Computation and Competitive Analysis. Cambridge University Press, New York, NY."},{"key":"e_1_3_3_9_2","volume-title":"Proceedings of the 2nd AAAI Conference on Human Computation and Crowdsourcing","author":"Bragg Jonathan","year":"2014","unstructured":"Jonathan Bragg, Andrey Kolobov, Mausam Mausam, and Daniel S. Weld. 2014. Parallel task routing for crowdsourcing. In Proceedings of the 2nd AAAI Conference on Human Computation and Crowdsourcing."},{"key":"e_1_3_3_10_2","doi-asserted-by":"crossref","DOI":"10.1007\/s00453-020-00698-3","article-title":"Online stochastic matching: New algorithms and bounds","author":"Brubach Brian","year":"2020","unstructured":"Brian Brubach, Karthik Abinav Sankararaman, Aravind Srinivasan, and Pan Xu. 2020. Online stochastic matching: New algorithms and bounds. Algorithmica, 82, 10 (2020), 2737\u20132783.","journal-title":"Algorithmica"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2853093"},{"issue":"13","key":"e_1_3_3_12_2","article-title":"Gmission: A general spatial crowdsourcing platform","volume":"7","author":"Chen Zhao","year":"2014","unstructured":"Zhao Chen, Rui Fu, Ziyuan Zhao, Zheng Liu, Leihao Xia, Lei Chen, Peng Cheng, Caleb Chen Cao, Yongxin Tong, and Chen Jason Zhang. 2014. Gmission: A general spatial crowdsourcing platform. Proc. VLDB Endow. 7, 13 (2014).","journal-title":"Proc. VLDB Endow."},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-030-64946-3_2","volume-title":"Proceedings of the International Conference on Web and Internet Economics","author":"Collina Natalie","year":"2020","unstructured":"Natalie Collina, Nicole Immorlica, Kevin Leyton-Brown, Brendan Lucier, and Neil Newman. 2020. Dynamic weighted matching with heterogeneous arrival and departure rates. In Proceedings of the International Conference on Web and Internet Economics. Springer, 17\u201330."},{"key":"e_1_3_3_14_2","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/2488388.2488421","volume-title":"Proceedings of the 22nd International Conference on World Wide Web","author":"Difallah Djellel Eddine","year":"2013","unstructured":"Djellel Eddine Difallah, Gianluca Demartini, and Philippe Cudr\u00e9-Mauroux. 2013. Pick-a-crowd: Tell me what you like, and i\u2019ll tell you what to do. In Proceedings of the 22nd International Conference on World Wide Web. 367\u2013374."},{"key":"e_1_3_3_15_2","article-title":"Online matching in a ride-sharing platform","author":"Dutta Chinmoy","year":"2018","unstructured":"Chinmoy Dutta and Chris Sholley. 2018. Online matching in a ride-sharing platform. Retrieved from https:\/\/arXiv:1806.10327","journal-title":"R"},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/FOCS.2009.72","volume-title":"Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201909)","author":"Feldman Jon","year":"2009","unstructured":"Jon Feldman, Aranyak Mehta, Vahab Mirrokni, and S Muthukrishnan. 2009. Online stochastic matching: Beating 1-1\/e. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201909). IEEE, 117\u2013126."},{"issue":"3","key":"e_1_3_3_17_2","article-title":"Dependent rounding and its applications to approximation algorithms","volume":"53","author":"Gandhi Rajiv","year":"2006","unstructured":"Rajiv Gandhi, Samir Khuller, Srinivasan Parthasarathy, and Aravind Srinivasan. 2006. Dependent rounding and its applications to approximation algorithms. J. ACM 53, 3 (2006).","journal-title":"J. ACM"},{"key":"e_1_3_3_18_2","volume-title":"Proceedings of the NIPS Workshop on Crowdsourcing","author":"Goel Gagan","year":"2013","unstructured":"Gagan Goel, Afshin Nikzad, and Adish Singla. 2013. Matching workers expertise with tasks: Incentives in heterogeneous crowdsourcing markets. In Proceedings of the NIPS Workshop on Crowdsourcing."},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/2567948.2577311","volume-title":"Proceedings of the 23rd International Conference on World Wide Web","author":"Goel Gagan","year":"2014","unstructured":"Gagan Goel, Afshin Nikzad, and Adish Singla. 2014. Allocating tasks to workers with matching constraints: Truthful mechanisms for crowdsourcing markets. In Proceedings of the 23rd International Conference on World Wide Web. ACM, 279\u2013280."},{"key":"e_1_3_3_20_2","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/978-3-642-25510-6_15","volume-title":"Proceedings of the International Workshop on Internet and Network Economics","author":"Haeupler Bernhard","year":"2011","unstructured":"Bernhard Haeupler, Vahab S. Mirrokni, and Morteza Zadimoghaddam. 2011. Online stochastic weighted matching: Improved approximation algorithms. In Proceedings of the International Workshop on Internet and Network Economics. Springer, 170\u2013181."},{"key":"e_1_3_3_21_2","first-page":"212","volume-title":"Proceedings of the 11th IEEE International Conference on Ubiquitous Intelligence and Computing (UIC\u201914)","author":"Hassan U. U.","year":"2014","unstructured":"U. U. Hassan and E. Curry. 2014. A multi-armed bandit approach to online spatial task assignment. In Proceedings of the 11th IEEE International Conference on Ubiquitous Intelligence and Computing (UIC\u201914). 212\u2013219."},{"key":"e_1_3_3_22_2","first-page":"45","volume-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence","author":"Ho Chien-Ju","year":"2012","unstructured":"Chien-Ju Ho and Jennifer Wortman Vaughan. 2012. Online task assignment in crowdsourcing markets. In Proceedings of the 26th AAAI Conference on Artificial Intelligence. 45\u201351."},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/3188745.3188858","volume-title":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","author":"Huang Zhiyi","year":"2018","unstructured":"Zhiyi Huang, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang, and Xue Zhu. 2018. How to match when all vertices arrive online. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. ACM, 17\u201329."},{"issue":"3","key":"e_1_3_3_24_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3326169","article-title":"Online vertex-weighted bipartite matching: Beating 1-1\/e with random arrivals","volume":"15","author":"Huang Zhiyi","year":"2019","unstructured":"Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. 2019. Online vertex-weighted bipartite matching: Beating 1-1\/e with random arrivals. ACM Trans. Algor. 15, 3 (2019), 1\u201315.","journal-title":"ACM Trans. Algor."},{"key":"e_1_3_3_25_2","article-title":"Fully online matching ii: Beating ranking and water-filling","author":"Huang Zhiyi","year":"2020","unstructured":"Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. 2020. Fully online matching ii: Beating ranking and water-filling. Retrieved from https:\/\/arXiv:2005.06311","journal-title":"R"},{"key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1145\/3357713.3384294","volume-title":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","author":"Huang Zhiyi","year":"2020","unstructured":"Zhiyi Huang and Qiankun Zhang. 2020. Online primal dual meets online matching with stochastic rewards: Configuration lp to the rescue. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. 1153\u20131164."},{"issue":"3","key":"e_1_3_3_27_2","article-title":"Online stochastic matching: New algorithms with better bounds","volume":"39","author":"Jaillet Patrick","year":"2013","unstructured":"Patrick Jaillet and Xin Lu. 2013. Online stochastic matching: New algorithms with better bounds. Math. Oper. Res. 39, 3 (2013).","journal-title":"Math. Oper. Res."},{"key":"e_1_3_3_28_2","first-page":"587","volume-title":"Proceedings of the 43rd Annual ACM Symposium on Theory of Computing","author":"Karande Chinmay","year":"2011","unstructured":"Chinmay Karande, Aranyak Mehta, and Pushkar Tripathi. 2011. Online bipartite matching with unknown distributions. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing. ACM, 587\u2013596."},{"key":"e_1_3_3_29_2","first-page":"352","volume-title":"Proceedings of the 22nd Annual ACM Symposium on Theory of Computing","author":"Karp Richard M.","year":"1990","unstructured":"Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. 1990. An optimal algorithm for on-line bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 352\u2013358."},{"key":"e_1_3_3_30_2","volume-title":"Proceedings of the 1st AAAI Conference on Human Computation and Crowdsourcing","author":"Kolobov Andrey","year":"2013","unstructured":"Andrey Kolobov, Daniel S. Weld et\u00a0al. 2013. Joint crowdsourcing of multiple tasks. In Proceedings of the 1st AAAI Conference on Human Computation and Crowdsourcing."},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.2989332"},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","unstructured":"Will Ma Pan Xu and Yifan Xu. 2023. Fairness maximization among offline agents in online-matching markets. ACM Trans. Economics and Comput. 10 4 (2023) 1\u201327.","DOI":"10.1145\/3569705"},{"key":"e_1_3_3_33_2","article-title":"Random-order contention resolution via continuous induction: Tightness for bipartite matching under vertex arrivals","author":"MacRury Calum","year":"2023","unstructured":"Calum MacRury and Will Ma. 2023. Random-order contention resolution via continuous induction: Tightness for bipartite matching under vertex arrivals. Retrieved from https:\/\/arXiv:2310.10101","journal-title":"R"},{"issue":"4","key":"e_1_3_3_34_2","article-title":"Online stochastic matching: Online actions based on offline statistics","volume":"37","author":"Manshadi Vahideh H.","year":"2012","unstructured":"Vahideh H. Manshadi, Shayan Oveis Gharan, and Amin Saberi. 2012. Online stochastic matching: Online actions based on offline statistics. Math. Oper. Res. 37, 4 (2012).","journal-title":"Math. Oper. Res."},{"key":"e_1_3_3_35_2","first-page":"345","volume-title":"Proceedings of the 26th International Joint Conference on Artificial Intelligence","author":"Mattei Nicholas","year":"2017","unstructured":"Nicholas Mattei, Abdallah Saffidine, and Toby Walsh. 2017. Mechanisms for online organ matching. In Proceedings of the 26th International Joint Conference on Artificial Intelligence. 345\u2013351."},{"issue":"4","key":"e_1_3_3_36_2","article-title":"Online matching and ad allocation","volume":"8","author":"Mehta Aranyak","year":"2012","unstructured":"Aranyak Mehta. 2012. Online matching and ad allocation. Theor. Comput. Sci. 8, 4 (2012).","journal-title":"Theor. Comput. Sci."},{"key":"e_1_3_3_37_2","first-page":"303","volume-title":"Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems","author":"Meir Reshef","year":"2013","unstructured":"Reshef Meir, Yiling Chen, and Michal Feldman. 2013. Efficient parking allocation as online bipartite matching with posted prices. In Proceedings of the International Conference on Autonomous Agents and Multi-agent Systems. 303\u2013310."},{"issue":"3","key":"e_1_3_3_38_2","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/TITS.2013.2262376","article-title":"Predicting taxi\u2013passenger demand using streaming data","volume":"14","author":"Moreira-Matias Luis","year":"2013","unstructured":"Luis Moreira-Matias, Joao Gama, Michel Ferreira, Joao Mendes-Moreira, and Luis Damas. 2013. Predicting taxi\u2013passenger demand using streaming data. IEEE Trans. Intell. Transport. Syst. 14, 3 (2013), 1393\u20131402.","journal-title":"IEEE Trans. Intell. Transport. Syst."},{"key":"e_1_3_3_39_2","first-page":"2210","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"34","author":"Nanda Vedant","year":"2020","unstructured":"Vedant Nanda, Pan Xu, Karthik Abhinav Sankararaman, John Dickerson, and Aravind Srinivasan. 2020. Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 2210\u20132217."},{"key":"e_1_3_3_40_2","volume-title":"Proceedings of the 24th Annual ACM Symposium on User Interface Software and Technology","author":"Rzeszotarski Jeffrey M.","year":"2011","unstructured":"Jeffrey M. Rzeszotarski and Aniket Kittur. 2011. Instrumenting the crowd: Using implicit behavioral measures to predict task performance. In Proceedings of the 24th Annual ACM Symposium on User Interface Software and Technology."},{"key":"e_1_3_3_41_2","first-page":"55","volume-title":"Proceedings of the 11th AAAI Conference on Human Computation","author":"Singer Yaron","year":"2011","unstructured":"Yaron Singer and Manas Mittal. 2011. Pricing tasks in online labor markets. In Proceedings of the 11th AAAI Conference on Human Computation. 55\u201360."},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1145\/2488388.2488489","volume-title":"Proceedings of the 22nd International Conference on World Wide Web","author":"Singer Yaron","year":"2013","unstructured":"Yaron Singer and Manas Mittal. 2013. Pricing mechanisms for crowdsourcing markets. In Proceedings of the 22nd International Conference on World Wide Web. 1157\u20131166."},{"key":"e_1_3_3_43_2","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1145\/2488388.2488490","volume-title":"Proceedings of the 22nd International Conference on World Wide Web","author":"Singla Adish","year":"2013","unstructured":"Adish Singla and Andreas Krause. 2013. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In Proceedings of the 22nd International Conference on World Wide Web. 1167\u20131178."},{"key":"e_1_3_3_44_2","first-page":"403","volume-title":"Proceedings of the 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt\u201915)","author":"Subramanian A.","year":"2015","unstructured":"A. Subramanian, G. S. Kanth, S. Moharir, and R. Vaze. 2015. Online incentive mechanism design for smartphone crowd-sourcing. In Proceedings of the 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt\u201915). 403\u2013410."},{"issue":"12","key":"e_1_3_3_45_2","article-title":"Online minimum matching in real-time spatial data: Experiments and analysis","volume":"9","author":"Tong Yongxin","year":"2016","unstructured":"Yongxin Tong, Jieying She, Bolin Ding, Lei Chen, Tianyu Wo, and Ke Xu. 2016. Online minimum matching in real-time spatial data: Experiments and analysis. Proc. VLDB Endow. 9, 12 (2016).","journal-title":"Proc. VLDB Endow."},{"key":"e_1_3_3_46_2","first-page":"49","volume-title":"Proceedings of the IEEE 32nd International Conference on Data Engineering (ICDE)","author":"Tong Y.","year":"2016","unstructured":"Y. Tong, J. She, B. Ding, L. Wang, and L. Chen. 2016. Online mobile micro-task allocation in spatial crowdsourcing. In Proceedings of the IEEE 32nd International Conference on Data Engineering (ICDE). 49\u201360."},{"issue":"11","key":"e_1_3_3_47_2","doi-asserted-by":"crossref","first-page":"1334","DOI":"10.14778\/3137628.3137643","article-title":"Flexible online task assignment in real-time spatial data","volume":"10","author":"Tong Yongxin","year":"2017","unstructured":"Yongxin Tong, Libin Wang, Zimu Zhou, Bolin Ding, Lei Chen, Jieping Ye, and Ke Xu. 2017. Flexible online task assignment in real-time spatial data. Proc. VLDB Endow. 10, 11 (2017), 1334\u20131345.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_3_3_48_2","unstructured":"Van-Anh Truong and Xinshang Wang. 2019. Prophet inequality with correlated arrival probabilities with application to two sided matchings. Retrieved from https:\/\/arXiv:1901.02552"},{"key":"e_1_3_3_49_2","article-title":"Online advance admission scheduling for services with customer preferences","author":"Wang Xinshang","year":"2018","unstructured":"Xinshang Wang, Van-Anh Truong, and David Bank. 2018. Online advance admission scheduling for services with customer preferences. Retrieved from https:\/\/arXiv:1805.10412","journal-title":"R"},{"key":"e_1_3_3_50_2","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1007\/978-3-662-47672-7_87","volume-title":"Automata, Languages, and Programming. Part I","author":"Wang Yajun","year":"2015","unstructured":"Yajun Wang and Sam Chiu-wai Wong. 2015. Two-sided online bipartite matching and vertex cover: Beating the greedy algorithm. In Automata, Languages, and Programming. Part I. Vol. 9134. 1070\u20131081."},{"issue":"8","key":"e_1_3_3_51_2","article-title":"Online task assignment for crowdsensing in predictable mobile social networks","volume":"16","author":"Xiao Mingjun","year":"2017","unstructured":"Mingjun Xiao, Jie Wu, Liusheng Huang, Ruhong Cheng, and Yunsheng Wang. 2017. Online task assignment for crowdsensing in predictable mobile social networks. IEEE Trans. Mobile Comput. 16, 8 (2017).","journal-title":"IEEE Trans. Mobile Comput."},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/2348543.2348567","volume-title":"Proceedings of the 18th Annual International Conference on Mobile Computing and Networking","author":"Yang Dejun","year":"2012","unstructured":"Dejun Yang, Guoliang Xue, Xi Fang, and Jian Tang. 2012. Crowdsourcing to smartphones: Incentive mechanism design for mobile phone sensing. In Proceedings of the 18th Annual International Conference on Mobile Computing and Networking. 173\u2013184."},{"key":"e_1_3_3_53_2","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"32","author":"Yao Huaxiu","year":"2018","unstructured":"Huaxiu Yao, Fei Wu, Jintao Ke, Xianfeng Tang, Yitian Jia, Siyu Lu, Pinghua Gong, Jieping Ye, and Zhenhui Li. 2018. Deep multi-view spatial-temporal network for taxi demand prediction. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 32."},{"key":"e_1_3_3_54_2","first-page":"2812","volume-title":"Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201915)","author":"Zhang Qi","year":"2015","unstructured":"Qi Zhang, Yutian Wen, Xiaohua Tian, Xiaoying Gan, and Xinbing Wang. 2015. Incentivize crowd labeling under budget constraint. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM\u201915). IEEE, 2812\u20132820."},{"key":"e_1_3_3_55_2","first-page":"833","volume-title":"Proceedings of the IEEE International Conference on Big Data (Big Data\u201916)","author":"Zhao Kai","year":"2016","unstructured":"Kai Zhao, Denis Khryashchev, Juliana Freire, Cl\u00e1udio Silva, and Huy Vo. 2016. Predicting taxi demand at high spatial resolution: Approaching the limit of predictability. In Proceedings of the IEEE International Conference on Big Data (Big Data\u201916). IEEE, 833\u2013842."}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652021","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3652021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:13Z","timestamp":1750268953000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3652021"],"URL":"https:\/\/doi.org\/10.1145\/3652021","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"value":"2167-8375","type":"print"},{"value":"2167-8383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"2021-10-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-06","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}