{"id":"https://openalex.org/W3020987299","doi":"https://doi.org/10.1145/3556971","title":"Edge-Weighted Online Bipartite Matching","display_name":"Edge-Weighted Online Bipartite Matching","publication_year":2022,"publication_date":"2022-08-13","ids":{"openalex":"https://openalex.org/W3020987299","doi":"https://doi.org/10.1145/3556971","mag":"3020987299"},"language":"en","primary_location":{"id":"doi:10.1145/3556971","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3556971","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3556971","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3556971","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019846729","display_name":"Matthew Fahrbach","orcid":"https://orcid.org/0000-0002-3142-7133"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew Fahrbach","raw_affiliation_strings":["Google Research, New York, NY, United States"],"raw_orcid":"https://orcid.org/0000-0002-3142-7133","affiliations":[{"raw_affiliation_string":"Google Research, New York, NY, United States","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044562275","display_name":"Zhiyi Huang","orcid":"https://orcid.org/0000-0003-2963-9556"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Zhiyi Huang","raw_affiliation_strings":["The University of Hong Kong, Pokfulam, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0003-2963-9556","affiliations":[{"raw_affiliation_string":"The University of Hong Kong, Pokfulam, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016831506","display_name":"Runzhou Tao","orcid":"https://orcid.org/0000-0002-3733-5168"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Runzhou Tao","raw_affiliation_strings":["Columbia University, New York, NY, United States"],"raw_orcid":"https://orcid.org/0000-0002-3733-5168","affiliations":[{"raw_affiliation_string":"Columbia University, New York, NY, United States","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024817143","display_name":"Morteza Zadimoghaddam","orcid":"https://orcid.org/0000-0003-0717-1120"},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Morteza Zadimoghaddam","raw_affiliation_strings":["Google Research, New York, NY, United States"],"raw_orcid":"https://orcid.org/0000-0003-0717-1120","affiliations":[{"raw_affiliation_string":"Google Research, New York, NY, United States","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5019846729"],"corresponding_institution_ids":["https://openalex.org/I1291425158"],"apc_list":null,"apc_paid":null,"fwci":1.9974,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.86339381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"69","issue":"6","first_page":"1","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7822426557540894},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7406858801841736},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6947546601295471},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6434261798858643},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6322229504585266},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.628456175327301},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5709227323532104},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5699625015258789},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.5682843327522278},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5663152933120728},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4732777774333954},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.41204768419265747},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4111233353614807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3388170003890991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3092518448829651},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2874385714530945},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28711211681365967},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.26194941997528076},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08975487947463989}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7822426557540894},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7406858801841736},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6947546601295471},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6434261798858643},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6322229504585266},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.628456175327301},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5709227323532104},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5699625015258789},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5682843327522278},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5663152933120728},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4732777774333954},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.41204768419265747},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4111233353614807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3388170003890991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3092518448829651},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2874385714530945},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28711211681365967},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26194941997528076},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08975487947463989},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3556971","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3556971","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3556971","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2005.01929","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2005.01929","pdf_url":"https://arxiv.org/pdf/2005.01929","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3556971","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3556971","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3556971","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1637230994","display_name":null,"funder_award_id":"grant DGE-1650044","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7798911258","display_name":null,"funder_award_id":"1650044","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3020987299.pdf","grobid_xml":"https://content.openalex.org/works/W3020987299.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W205662698","https://openalex.org/W1496647032","https://openalex.org/W1522394790","https://openalex.org/W1578666690","https://openalex.org/W1659045240","https://openalex.org/W1680189815","https://openalex.org/W1769120835","https://openalex.org/W1783659154","https://openalex.org/W1966695467","https://openalex.org/W1996313212","https://openalex.org/W2011730242","https://openalex.org/W2029945631","https://openalex.org/W2039251573","https://openalex.org/W2042873949","https://openalex.org/W2070546659","https://openalex.org/W2079669094","https://openalex.org/W2085938855","https://openalex.org/W2104224720","https://openalex.org/W2158268067","https://openalex.org/W2162656786","https://openalex.org/W2166588237","https://openalex.org/W2170675255","https://openalex.org/W2183531780","https://openalex.org/W2246475462","https://openalex.org/W2285500630","https://openalex.org/W2401584318","https://openalex.org/W2571343094","https://openalex.org/W2613492636","https://openalex.org/W2757107770","https://openalex.org/W2809732835","https://openalex.org/W2897002186","https://openalex.org/W2903354203","https://openalex.org/W2949270856","https://openalex.org/W2949691426","https://openalex.org/W2951195910","https://openalex.org/W2952720641","https://openalex.org/W2962711478","https://openalex.org/W2963014036","https://openalex.org/W2964260368","https://openalex.org/W2964293104","https://openalex.org/W2972193181","https://openalex.org/W2977358693","https://openalex.org/W3006942659","https://openalex.org/W3102310897","https://openalex.org/W3126370525","https://openalex.org/W3127045178","https://openalex.org/W3169625266","https://openalex.org/W4221165155","https://openalex.org/W4223978449","https://openalex.org/W4233282175","https://openalex.org/W4247154108","https://openalex.org/W4252172911","https://openalex.org/W4394658795"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W4367393448","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2004975914"],"abstract_inverted_index":{"Online":[0],"bipartite":[1,27,133],"matching":[2,28,134,152],"is":[3,54,135,154,217],"one":[4,175],"of":[5,35,90,96,100,167,169,181,210,218],"the":[6,11,50,58,65,75,81,97,115,194,208],"most":[7,59],"fundamental":[8],"problems":[9],"in":[10,142,149,226],"online":[12,77,144,151,159,228],"algorithms":[13],"literature.":[14],"Karp,":[15],"Vazirani,":[16],"and":[17,47,85,103,173,202,221],"Vazirani":[18],"(STOC":[19],"1990)":[20],"gave":[21],"an":[22,31,143],"elegant":[23],"algorithm":[24,46,78,153],"for":[25,114],"unweighted":[26],"that":[29,79,131],"achieves":[30,86],"optimal":[32],"competitive":[33,88,112],"ratio":[34,89,113],"1-1/e":[36],".":[37],"Aggarwal":[38],"et":[39],"al.":[40],"(SODA":[41,105],"2011)":[42],"later":[43],"generalized":[44],"their":[45],"analysis":[48],"to":[49,187],"vertex-weighted":[51],"case.":[52],"Little":[53],"known,":[55],"however,":[56],"about":[57],"general":[60,117],"edge-weighted":[61,132],"problem":[62],"aside":[63],"from":[64,177,191],"trivial":[66],"1/2-competitive":[67],"greedy":[68],"algorithm.":[69],"In":[70,94],"this":[71],"article,":[72],"we":[73],"present":[74],"first":[76],"breaks":[80],"long-standing":[82],"1/2":[83,111],"barrier":[84],"a":[87,110,155,165,183,189,204],"at":[91],"least":[92],"0.5086.":[93],"light":[95],"hardness":[98],"result":[99,124],"Kapralov,":[101],"Post,":[102],"Vondr\u00e1k":[104],"2013),":[106],"which":[107,163],"restricts":[108],"beating":[109],"more":[116],"monotone":[118],"submodular":[119,139],"welfare":[120,140],"maximization":[121,141],"problem,":[122],"our":[123,150,214],"can":[125],"be":[126],"seen":[127],"as":[128,171],"strong":[129],"evidence":[130],"strictly":[136],"easier":[137],"than":[138],"setting.":[145],"The":[146],"main":[147],"ingredient":[148],"novel":[156],"subroutine":[157],"called":[158],"correlated":[160],"selection":[161],"(OCS),":[162],"takes":[164],"sequence":[166],"pairs":[168,201],"vertices":[170],"input":[172],"selects":[174],"vertex":[176,190],"each":[178,192],"pair.":[179],"Instead":[180],"using":[182],"fresh":[184],"random":[185],"bit":[186],"choose":[188],"pair,":[193],"OCS":[195,215],"negatively":[196],"correlates":[197],"decisions":[198],"across":[199],"different":[200],"provides":[203],"quantitative":[205],"measure":[206],"on":[207],"level":[209],"correlation.":[211],"We":[212],"believe":[213],"technique":[216],"independent":[219],"interest":[220],"will":[222],"find":[223],"further":[224],"applications":[225],"other":[227],"optimization":[229],"problems.":[230]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}