{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:25:51Z","timestamp":1778495151060,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"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_22","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"384-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Online Matching with\u00a0Stochastic Rewards: Advanced Analyses Using Configuration Linear Programs"],"prefix":"10.1007","author":[{"given":"Zhiyi","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanrui","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aocheng","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junkai","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiankun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"22_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"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1360443.1360462","volume":"39","author":"B Birnbaum","year":"2008","unstructured":"Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. ACM SIGACT News 39(1), 80\u201387 (2008)","journal-title":"ACM SIGACT News"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Blanc, G., Charikar, M.: Multiway online correlated selection. In: FOCS, pp. 1277\u20131284. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00124"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-75520-3_24","volume-title":"Algorithms \u2013 ESA 2007","author":"N Buchbinder","year":"2007","unstructured":"Buchbinder, N., Jain, K., Naor, J.S.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 253\u2013264. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_24"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2892563","volume":"4","author":"NR Devanur","year":"2016","unstructured":"Devanur, N.R., Huang, Z., Korula, N., Mirrokni, V.S., Yan, Q.: Whole-page optimization and submodular welfare maximization with online bidders. ACM Trans. Econ. Comput. 4(3), 1\u201320 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Devanur, N.R., Jain, K.: Online matching with concave returns. In: STOC, pp. 137\u2013144 (2012)","DOI":"10.1145\/2213977.2213992"},{"key":"22_CR7","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"},{"issue":"6","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3556971","volume":"69","author":"M Fahrbach","year":"2022","unstructured":"Fahrbach, M., Huang, Z., Tao, R., Zadimoghaddam, M.: Edge-weighted online bipartite matching. J. ACM 69(6), 1\u201335 (2022)","journal-title":"J. ACM"},{"key":"22_CR9","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":"22_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: beating $$1-\\frac{1}{e}$$. In: FOCS, pp. 117\u2013126. IEEE (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Gao, R., He, Z., Huang, Z., Nie, Z., Yuan, B., Zhong, Y.: Improved online correlated selection. In: FOCS, pp. 1265\u20131276. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00123"},{"key":"22_CR12","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA, pp. 982\u2013991 (2008)"},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/opre.2022.2345","volume":"71","author":"V Goyal","year":"2023","unstructured":"Goyal, V., Udwani, R.: Online matching with stochastic rewards: optimal competitive ratio via path-based formulation. Oper. Res. 71(2), 563\u2013580 (2023)","journal-title":"Oper. Res."},{"key":"22_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 (2021)","DOI":"10.1145\/3406325.3451079"},{"key":"22_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 (2022)","DOI":"10.1145\/3519935.3520046"},{"issue":"3","key":"22_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3326169","volume":"15","author":"Z Huang","year":"2019","unstructured":"Huang, Z., Tang, Z.G., Wu, X., Zhang, Y.: Online vertex-weighted bipartite matching: beating $$1-\\frac{1}{e}$$ with random arrivals. ACM Trans. Algorithms 15(3), 1\u201315 (2019)","journal-title":"ACM Trans. Algorithms"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zhang, Q.: Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue. In: STOC, pp. 1153\u20131164. ACM (2020)","DOI":"10.1145\/3357713.3384294"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zhang, Q., Zhang, Y.: AdWords in a panorama. In: FOCS, pp. 1416\u20131426. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00133"},{"key":"22_CR19","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"},{"issue":"1\u20132","key":"22_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.R.: An optimal deterministic algorithm for online $$b$$-matching. Theor. Comput. Sci. 233(1\u20132), 319\u2013325 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Karande, C., Mehta, A., Tripathi, P.: Online bipartite matching with unknown distributions. In: STOC, pp. 587\u2013596 (2011)","DOI":"10.1145\/1993636.1993715"},{"key":"22_CR22","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":"22_CR23","unstructured":"Liang, J., Tang, Z.G., Xu, Y., Zhang, Y., Zhou, R.: On the perturbation function of ranking and balance for weighted online bipartite matching. ArXiv abs\/2210.10370 (2022)"},{"key":"22_CR24","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 (2011)","DOI":"10.1145\/1993636.1993716"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Mehta, A., Panigrahi, D.: Online matching with stochastic rewards. In: FOCS, pp. 728\u2013737. IEEE (2012)","DOI":"10.1109\/FOCS.2012.65"},{"key":"22_CR26","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized online matching. J. ACM 54(5), 22-es (2007)","DOI":"10.1145\/1284320.1284321"},{"key":"22_CR27","unstructured":"Shin, Y., An, H.C.: Making three out of two: three-way online correlated selection. In: ISAAC. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"22_CR28","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 (2022)","DOI":"10.1145\/3519935.3519994"},{"key":"22_CR29","unstructured":"Udwani, R.: Adwords with unknown budgets and beyond. ArXiv abs\/2110.00504 (2021)"},{"key":"22_CR30","unstructured":"Vazirani, V.V.: Towards a practical, budget-oblivious algorithm for the adwords problem under small bids. ArXiv abs\/2107.10777 (2022)"}],"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_22","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_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_22","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)"}}]}}