{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:48:57Z","timestamp":1767340137065,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"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_30","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"527-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Competitive Ratio for\u00a0Edge-Weighted Online Stochastic Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9181-8259","authenticated-orcid":false,"given":"Guoliang","family":"Qiu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0491-3533","authenticated-orcid":false,"given":"Yilong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9739-1308","authenticated-orcid":false,"given":"Shengwei","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5766-2115","authenticated-orcid":false,"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: SODA, pp. 1253\u20131264. SIAM (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"30_CR2","unstructured":"Albers, S., Schubert, S.: Tight bounds for online matching in bounded-degree graphs with vertex capacities. In: ESA. LIPIcs, vol. 244, pp. 4:1\u20134:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-15775-2_15","volume-title":"Algorithms \u2013 ESA 2010","author":"B Bahmani","year":"2010","unstructured":"Bahmani, B., Kapralov, M.: Improved bounds for online stochastic matching. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 170\u2013181. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15775-2_15"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1360443.1360462","volume":"39","author":"BE Birnbaum","year":"2008","unstructured":"Birnbaum, B.E., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39(1), 80\u201387 (2008)","journal-title":"SIGACT News"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Blanc, G., Charikar, M.: Multiway online correlated selection. In: FOCS, pp. 1277\u20131284. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00124"},{"issue":"10","key":"30_CR6","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(10), 2737\u20132783 (2020)","journal-title":"Algorithmica"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, I.R., Wajc, D.: Randomized online matching in regular graphs. In: SODA, pp. 960\u2013979. SIAM (2018)","DOI":"10.1137\/1.9781611975031.62"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K., Kleinberg, R.D.: Randomized primal-dual analysis of RANKING for online bipartite matching. In: SODA, pp. 101\u2013107. SIAM (2013)","DOI":"10.1137\/1.9781611973105.7"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Fahrbach, M., Huang, Z., Tao, R., Zadimoghaddam, M.: Edge-weighted online bipartite matching. J. ACM 69(6), 45:1\u201345:35 (2022)","DOI":"10.1145\/3556971"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-10841-9_34","volume-title":"Internet and Network Economics","author":"J Feldman","year":"2009","unstructured":"Feldman, J., Korula, N., Mirrokni, V., Muthukrishnan, S., P\u00e1l, M.: Online ad assignment with free disposal. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 374\u2013385. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_34"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V.S., Muthukrishnan, S.: Online stochastic matching: beating 1\u20131\/e. In: FOCS, pp. 117\u2013126. IEEE Computer Society (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"30_CR12","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA, pp. 982\u2013991. SIAM (2008)"},{"key":"30_CR13","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":"30_CR14","doi-asserted-by":"crossref","unstructured":"Huang, Z., Shu, X.: Online stochastic matching, Poisson arrivals, and the natural linear program. In: STOC, pp. 682\u2013693. ACM (2021)","DOI":"10.1145\/3406325.3451079"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Z., Shu, X., Yan, S.: The power of multiple choices in online stochastic matching. In: STOC, pp. 91\u2013103. ACM (2022)","DOI":"10.1145\/3519935.3520046"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Huang, Z., Tang, Z.G., Wu, X., Zhang, Y.: Online vertex-weighted bipartite matching: beating 1\u20131\/e with random arrivals. ACM Trans. Algorithms 15(3), 38:1\u201338:15 (2019)","DOI":"10.1145\/3326169"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1287\/moor.2013.0621","volume":"39","author":"P Jaillet","year":"2014","unstructured":"Jaillet, P., Lu, X.: Online stochastic matching: new algorithms with better bounds. Math. Oper. Res. 39(3), 624\u2013646 (2014)","journal-title":"Math. Oper. Res."},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-030-94676-0_12","volume-title":"Web and Internet Economics","author":"B Jin","year":"2022","unstructured":"Jin, B., Williamson, D.P.: Improved analysis of\u00a0RANKING for\u00a0online vertex-weighted bipartite matching in\u00a0the\u00a0random order model. In: Feldman, M., Fu, H., Talgam-Cohen, I. (eds.) WINE 2021. LNCS, vol. 13112, pp. 207\u2013225. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94676-0_12"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: STOC, pp. 587\u2013596. ACM (2011)","DOI":"10.1145\/1993636.1993715"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: STOC, pp. 352\u2013358. ACM (1990)","DOI":"10.1145\/100216.100262"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In: STOC, pp. 597\u2013606. ACM (2011)","DOI":"10.1145\/1993636.1993716"},{"issue":"4","key":"30_CR22","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":"30_CR23","doi-asserted-by":"crossref","unstructured":"Naor, J.S., Wajc, D.: Near-optimum online ad allocation for targeted advertising. ACM Trans. Econ. Comput. 6(3\u20134), 16:1\u201316:20 (2018)","DOI":"10.1145\/3105447"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Tang, Z.G., Wu, J., Wu, H.: (Fractional) online stochastic matching via fine-grained offline statistics. In: STOC, pp. 77\u201390. ACM (2022)","DOI":"10.1145\/3519935.3519994"},{"key":"30_CR25","doi-asserted-by":"publisher","unstructured":"Yan, S.: Edge-weighted online stochastic matching: beating 1\u20131\/e. CoRR abs\/2210.12543 (2022). https:\/\/doi.org\/10.48550\/arXiv.2210.12543","DOI":"10.48550\/arXiv.2210.12543"}],"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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T03:49:48Z","timestamp":1730951388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}