{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:30Z","timestamp":1750309350653,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T00:00:00Z","timestamp":1720396800000},"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":[[2024,7,8]]},"DOI":"10.1145\/3670865.3673459","type":"proceedings-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T20:13:33Z","timestamp":1734466413000},"page":"279-307","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Bounds for Fractional Online Matching Problems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5094-1971","authenticated-orcid":false,"given":"Zhihao Gavin","family":"Tang","sequence":"first","affiliation":[{"name":"Shanghai University of Finance and Economics, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9330-1926","authenticated-orcid":false,"given":"Yuhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Gagan Aggarwal Gagan Goel Chinmay Karande and Aranyak Mehta. 2011. Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. In SODA. 1253--1264.","DOI":"10.1137\/1.9781611973082.95"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Itai Ashlagi Maximilien Burq Chinmoy Dutta Patrick Jaillet Amin Saberi and Chris Sholley. 2019. Edge weighted online windowed matching. In EC. 729--742.","DOI":"10.1145\/3328526.3329573"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360443.1360462"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00124"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75520-3_24"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0505-7"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892563"},{"key":"e_1_3_2_1_8_1","volume-title":"Devanur and Kamal Jain","author":"Nikhil","year":"2012","unstructured":"Nikhil R. Devanur and Kamal Jain. 2012. Online matching with concave returns. In STOC. ACM, 137--144."},{"key":"e_1_3_2_1_9_1","volume-title":"Kleinberg","author":"Devanur Nikhil R.","year":"2013","unstructured":"Nikhil R. Devanur, Kamal Jain, and Robert D. Kleinberg. 2013. Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching. In SODA. SIAM, 101--107."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.ORL.2021.08.012"},{"key":"e_1_3_2_1_11_1","volume-title":"STACS (LIPIcs","volume":"399","author":"Epstein Leah","year":"2013","unstructured":"Leah Epstein, Asaf Levin, Danny Segev, and Oren Weimann. 2013. Improved Bounds for Online Preemptive Matching. In STACS (LIPIcs, Vol. 20). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 389--399."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Tomer Ezra Michal Feldman Nick Gravin and Zhihao Gavin Tang. 2020. Online Stochastic Max-Weight Matching: Prophet Inequality for Vertex and Edge Arrival Models. In EC. ACM 769--787.","DOI":"10.1145\/3391403.3399513"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Tomer Ezra Michal Feldman Nick Gravin and Zhihao Gavin Tang. 2022. General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching. In EC. ACM 1148--1177.","DOI":"10.1145\/3490486.3538290"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00046"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jon Feldman Nitish Korula Vahab S. Mirrokni S. Muthukrishnan and Martin P\u00e1l. 2009. Online Ad Assignment with Free Disposal. In WINE. 374--385.","DOI":"10.1007\/978-3-642-10841-9_34"},{"volume-title":"Online matching with general arrivals","author":"Gamlath Buddhima","key":"e_1_3_2_1_16_1","unstructured":"Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, and David Wajc. 2019. Online matching with general arrivals. In FOCS. IEEE, 26--37."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00123"},{"key":"e_1_3_2_1_18_1","unstructured":"Gagan Goel and Aranyak Mehta. 2008. Online budgeted matching in random input models with applications to Adwords. In SODA. 982--991."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3390890"},{"key":"e_1_3_2_1_20_1","volume-title":"Runzhou Tao, Xiaowei Wu, and Yuhao Zhang.","author":"Huang Zhiyi","year":"2019","unstructured":"Zhiyi Huang, Binghui Peng, Zhihao Gavin Tang, Runzhou Tao, Xiaowei Wu, and Yuhao Zhang. 2019a. Tight competitive ratios of classic matching algorithms in the fully online model. In SODA. SIAM, 2875--2886."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3326169"},{"key":"e_1_3_2_1_22_1","volume-title":"Xiaowei Wu, and Yuhao Zhang.","author":"Huang Zhiyi","year":"2020","unstructured":"Zhiyi Huang, Zhihao Gavin Tang, Xiaowei Wu, and Yuhao Zhang. 2020b. Fully Online Matching II: Beating Ranking and Water-filling. In FOCS. IEEE, 1380--1391."},{"volume-title":"AdWords in a Panorama","author":"Huang Zhiyi","key":"e_1_3_2_1_23_1","unstructured":"Zhiyi Huang, Qiankun Zhang, and Yuhao Zhang. 2020c. AdWords in a Panorama. In FOCS. IEEE, 1416--1426."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00140-1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Chinmay Karande Aranyak Mehta and Pushkar Tripathi. 2011. Online bipartite matching with unknown distributions. In STOC. 587--596.","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_1_26_1","volume-title":"Vazirani","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 STOC. 352--358."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-45046-4_25"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Mohammad Mahdian and Qiqi Yan. 2011. Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs. In STOC. 597--606.","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284321"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Yajun Wang and Sam Chiu-wai Wong. 2015. Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm. In ICALP. 1070--1081.","DOI":"10.1007\/978-3-662-47672-7_87"}],"event":{"name":"EC '24: 25th ACM Conference on Economics and Computation","sponsor":["SIGecom Special Interest Group on Economics and Computation"],"location":"New Haven CT USA","acronym":"EC '24"},"container-title":["Proceedings of the 25th ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673459","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3670865.3673459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:42Z","timestamp":1750291542000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3670865.3673459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,8]]},"references-count":30,"alternative-id":["10.1145\/3670865.3673459","10.1145\/3670865"],"URL":"https:\/\/doi.org\/10.1145\/3670865.3673459","relation":{},"subject":[],"published":{"date-parts":[[2024,7,8]]},"assertion":[{"value":"2024-12-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}