{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:30:58Z","timestamp":1768105858433,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031489730","type":"print"},{"value":"9783031489747","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_34","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"600-617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two-Sided Capacitated Submodular Maximization in\u00a0Gig Platforms"],"prefix":"10.1007","author":[{"given":"Pan","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Abbassi, Z., Mirrokni, V.S., Thakur, M.: Diversity maximization under matroid constraints. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 32\u201340 (2013)","DOI":"10.1145\/2487575.2487636"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Ahmed, F., Dickerson, J., Fuge, M.: Forming diverse teams from sequentially arriving people. CoRR abs\/2002.10697 (2020)","DOI":"10.1115\/1.4046998"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, F., Dickerson, J.P., Fuge, M.: Diverse weighted bipartite b-matching. arXiv preprint arXiv:1702.07134 (2017)","DOI":"10.24963\/ijcai.2017\/6"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Ahmed, F., Dickerson, J.P., Fuge, M.: Diverse weighted bipartite b-matching. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, pp. 35\u201341 (2017)","DOI":"10.24963\/ijcai.2017\/6"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., Leonardi, S.: Online team formation in social networks. In: Proceedings of the 21st International Conference on World Wide Web, pp. 839\u2013848 (2012)","DOI":"10.1145\/2187836.2187950"},{"key":"34_CR6","unstructured":"Anari, N., Haghtalab, N., Naor, J., Pokutta, S., Singh, M., Torrico, A.: Robust submodular maximization: offline and online algorithms. arXiv preprint arXiv:1710.04740 (2017)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Assadi, S., Hsu, J., Jabbari, S.: Online assignment of heterogeneous tasks in crowdsourcing markets. In: Third AAAI Conference on Human Computation and Crowdsourcing (2015)","DOI":"10.1609\/hcomp.v3i1.13236"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Barnab\u00f2, G., Fazzone, A., Leonardi, S., Schwiegelshohn, C.: Algorithms for fair team formation in online labour marketplaces. In: Companion Proceedings of The 2019 World Wide Web Conference, pp. 484\u2013490 (2019)","DOI":"10.1145\/3308560.3317587"},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1007\/s00453-020-00698-3","volume":"82","author":"B Brubach","year":"2020","unstructured":"Brubach, B., Sankararaman, K.A., Srinivasan, A., Xu, P.: Online stochastic matching: new algorithms and bounds. Algorithmica 82, 2737\u20132783 (2020)","journal-title":"Algorithmica"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Feldman, M., Schwartz, R.: Online submodular maximization with preemption. In: SODA (2015)","DOI":"10.1137\/1.9781611973730.80"},{"key":"34_CR11","unstructured":"Canonne, C.: A short note on Poisson tail bounds (2020). http:\/\/www.cs.columbia.edu\/ccanonne\/files\/misc\/2017-poissonconcentration.pdf. Accessed 01 Feb 2020"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"Chan, T., Huang, Z., Jiang, S.H.C., Kang, N., Tang, Z.G.: Online submodular maximization with free disposal: randomization beats 1\/4 for partition matroids. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1204\u20131223. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.78"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondrak, J., Zenklusen, R.: Dependent randomized rounding via exchange properties of combinatorial structures. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp. 575\u2013584. IEEE (2010)","DOI":"10.1109\/FOCS.2010.60"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. CoRR abs\/1105.4593 (2011). http:\/\/arxiv.org\/abs\/1105.4593","DOI":"10.1145\/1993636.1993740"},{"issue":"8","key":"34_CR15","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TKDE.2016.2550041","volume":"28","author":"P Cheng","year":"2016","unstructured":"Cheng, P., Lian, X., Chen, L., Han, J., Zhao, J.: Task assignment on multi-skill oriented spatial crowdsourcing. IEEE Trans. Knowl. Data Eng. 28(8), 2201\u20132215 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Dickerson, J.P., Sankararaman, K.A., Srinivasan, A., Xu, P.: Balancing relevance and diversity in online bipartite matching via submodularity. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1877\u20131884 (2019)","DOI":"10.1609\/aaai.v33i01.33011877"},{"key":"34_CR17","unstructured":"Esfandiari, H., Korula, N., Mirrokni, V.: Bi-objective online matching and submodular allocations. In: Advances in Neural Information Processing Systems, pp. 2739\u20132747 (2016)"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: beating 1\u20131\/e. In: 50th Annual IEEE Symposium on Foundations of Computer Science, 2009. FOCS\u201909, pp. 117\u2013126. IEEE (2009)","DOI":"10.1109\/FOCS.2009.72"},{"issue":"3","key":"34_CR20","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/1147954.1147956","volume":"53","author":"R Gandhi","year":"2006","unstructured":"Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding and its applications to approximation algorithms. J. ACM (JACM) 53(3), 324\u2013360 (2006)","journal-title":"J. ACM (JACM)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Ge, M., Delgado-Battenfeld, C., Jannach, D.: Beyond accuracy: evaluating recommender systems by coverage and serendipity. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 257\u2013260 (2010)","DOI":"10.1145\/1864708.1864761"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-25510-6_15","volume-title":"Internet and Network Economics","author":"B Haeupler","year":"2011","unstructured":"Haeupler, B., Mirrokni, V.S., Zadimoghaddam, M.: Online stochastic weighted matching: improved approximation algorithms. In: Chen, N., Elkind, E., Koutsoupias, E. (eds.) WINE 2011. LNCS, vol. 7090, pp. 170\u2013181. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25510-6_15"},{"key":"34_CR23","unstructured":"Ho, C.J., Vaughan, J.W.: Online task assignment in crowdsourcing markets. In: Twenty-Sixth AAAI Conference on Artificial Intelligence (2012)"},{"issue":"3","key":"34_CR24","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1287\/moor.2013.0621","volume":"39","author":"P Jaillet","year":"2013","unstructured":"Jaillet, P., Lu, X.: Online stochastic matching: new algorithms with better bounds. Math. Oper. Res. 39(3), 624\u2013646 (2013)","journal-title":"Math. Oper. Res."},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Post, I., Vondr\u00e1k, J.: Online submodular welfare maximization: greedy is optimal. In: SODA (2013)","DOI":"10.1137\/1.9781611973105.88"},{"key":"34_CR26","unstructured":"Karimi, M., Lucic, M., Hassani, H., Krause, A.: Stochastic submodular maximization: the case of coverage functions. In: Advances in Neural Information Processing Systems, pp. 6853\u20136863 (2017)"},{"issue":"3","key":"34_CR27","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1137\/15M1051142","volume":"47","author":"N Korula","year":"2018","unstructured":"Korula, N., Mirrokni, V., Zadimoghaddam, M.: Online submodular welfare maximization: greedy beats 1\/2 in random order. SIAM J. Comput. 47(3), 1056\u20131086 (2018)","journal-title":"SIAM J. Comput."},{"key":"34_CR28","first-page":"95","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. (MoR) 35, 95\u2013806 (2010)","journal-title":"Math. Oper. Res. (MoR)"},{"key":"34_CR29","doi-asserted-by":"crossref","unstructured":"Li, Y., Fu, K., Wang, Z., Shahabi, C., Ye, J., Liu, Y.: Multi-task representation learning for travel time estimation, pp. 1695\u20131704. KDD \u201918 (2018)","DOI":"10.1145\/3219819.3220033"},{"issue":"4","key":"34_CR30","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/moor.1120.0551","volume":"37","author":"VH Manshadi","year":"2012","unstructured":"Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: online actions based on offline statistics. Math. Oper. Res. 37(4), 559\u2013573 (2012)","journal-title":"Math. Oper. Res."},{"key":"34_CR31","unstructured":"Novorol, C.: https:\/\/ai-med.io\/ai-biases-ada-health-diversity-women\/ (2018). Accessed 20 Sept 2019"},{"key":"34_CR32","doi-asserted-by":"crossref","unstructured":"Puthiya Parambath, S.A., Usunier, N., Grandvalet, Y.: A coverage-based approach to recommendation diversity on similarity graph. In: Proceedings of the 10th ACM Conference on Recommender Systems, pp. 15\u201322 (2016)","DOI":"10.1145\/2959100.2959149"},{"key":"34_CR33","unstructured":"Rawitz, D., Ros\u00e9n, A.: Online budgeted maximum coverage. In: 24th Annual European Symposium on Algorithms (ESA 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"key":"34_CR34","unstructured":"Sarpatwar, K.K., Schieber, B., Shachnai, H.: Interleaved algorithms for constrained submodular function maximization. arXiv preprint arXiv:1705.06319 (2017)"},{"key":"34_CR35","doi-asserted-by":"crossref","unstructured":"Vondr\u00e1k, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 67\u201374 (2008)","DOI":"10.1145\/1374376.1374389"},{"key":"34_CR36","doi-asserted-by":"crossref","unstructured":"Xie, M., Wang, Q., Cui, Q., Yang, G., Li, M.: CQM: coverage-constrained quality maximization in crowdsourcing test. In: 2017 IEEE\/ACM 39th International Conference on Software Engineering Companion (ICSE-C), pp. 192\u2013194. IEEE (2017)","DOI":"10.1109\/ICSE-C.2017.112"},{"key":"34_CR37","unstructured":"Xu, P., Srinivasan, A., Sarpatwar, K.K., Wu, K.L.: Budgeted online assignment in crowdsourcing markets: theory and practice. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 1763\u20131765. International Foundation for Autonomous Agents and Multiagent Systems (2017)"},{"key":"34_CR38","doi-asserted-by":"crossref","unstructured":"Yao, H., et al.: Deep multi-view spatial-temporal network for taxi demand prediction, pp. 2588\u20132595. AAAI \u201918 (2018)","DOI":"10.1609\/aaai.v32i1.11836"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48974-7_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T03:50:13Z","timestamp":1730951413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","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":"221","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":"37","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":"0","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":"17% - 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":"8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","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)"}}]}}