{"id":"https://openalex.org/W2949565166","doi":"https://doi.org/10.1137/1.9781611973082.95","title":"Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations","display_name":"Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations","publication_year":2011,"publication_date":"2011-01-23","ids":{"openalex":"https://openalex.org/W2949565166","doi":"https://doi.org/10.1137/1.9781611973082.95","mag":"2949565166"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973082.95","doi":"https://doi.org/10.1137/1.9781611973082.95","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973082.95","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070757517","display_name":"Gagan Aggarwal","orcid":"https://orcid.org/0009-0003-3296-4891","observed_orcids":["https://orcid.org/0009-0003-3296-4891"]},"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":"Gagan Aggarwal","raw_affiliation_strings":["Google Inc., Mountain View"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Inc., Mountain View","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008057846","display_name":"Gagan Goel","orcid":"https://orcid.org/0000-0001-9035-0917","observed_orcids":["https://orcid.org/0000-0001-9035-0917"]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gagan Goel","raw_affiliation_strings":["Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035204666","display_name":"Chinmay Karande","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chinmay Karande","raw_affiliation_strings":["Georgia Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075894805","display_name":"Aranyak Mehta","orcid":"https://orcid.org/0000-0002-6132-4901","observed_orcids":["https://orcid.org/0000-0002-6132-4901"]},"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":"Aranyak Mehta","raw_affiliation_strings":["Google Inc., Mountain View"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Inc., Mountain View","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.9988,"has_fulltext":false,"cited_by_count":125,"citation_normalized_percentile":{"value":0.95364292,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1253","last_page":"1264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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":0.9984999895095825,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/online-bipartite-matching","display_name":"online bipartite matching","score":0.984000027179718},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.6290000081062317},{"id":"https://openalex.org/keywords/competitive-ratio","display_name":"competitive ratio","score":0.6919999718666077},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.5289999842643738}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8748834133148193},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6919726133346558},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6792159080505371},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6012288928031921},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5337957143783569},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.49498552083969116},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.49244436621665955},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4736707806587219},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.4604104459285736},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.45895180106163025},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4253462255001068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4112323224544525},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3709007501602173},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36475038528442383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34070560336112976},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.110079824924469},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.09159195423126221},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611973082.95","doi":"https://doi.org/10.1137/1.9781611973082.95","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973082.95","pdf_url":null,"source":{"id":"https://openalex.org/S4363608728","display_name":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W1601470474","https://openalex.org/W1704721253","https://openalex.org/W1978382073","https://openalex.org/W2004045061","https://openalex.org/W2011730242","https://openalex.org/W2022013502","https://openalex.org/W2048837158","https://openalex.org/W2113654320","https://openalex.org/W2131951207","https://openalex.org/W2170675255"],"related_works":["https://openalex.org/W2208110155","https://openalex.org/W1996806106","https://openalex.org/W2781235162","https://openalex.org/W2058681277","https://openalex.org/W2090027528","https://openalex.org/W2047204419","https://openalex.org/W2951573806","https://openalex.org/W2088826026","https://openalex.org/W96431103","https://openalex.org/W4372272740"],"abstract_inverted_index":{"We":[0,109],"study":[1],"the":[2,29,51,56,63,70,123,128,140,152,160,166,175,184,192,198],"following":[3],"vertex-weighted":[4],"online":[5,34,72,145,155],"bipartite":[6,14,73],"matching":[7,74],"problem:":[8],"G(U,":[9],"V,":[10],"E)":[11],"is":[12,48,97,177],"a":[13],"graph.":[15],"The":[16,46],"vertices":[17,30,58],"in":[18,31,35,59,89,130,132,144,159],"U":[19],"have":[20,40],"weights":[21,54,64,114],"and":[22,39,80,135],"are":[23,65,194],"known":[24,125],"ahead":[25],"of":[26,53,55,113,127,142,154,186],"time,":[27],"while":[28],"V":[32],"arrive":[33],"an":[36,83,98,163],"arbitrary":[37],"order":[38],"to":[41,49,69,179],"be":[42],"matched":[43,57],"upon":[44],"arrival.":[45],"goal":[47],"maximize":[50],"sum":[52],"U.":[60],"When":[61],"all":[62],"equal,":[66],"this":[67,133],"reduces":[68],"classic":[71],"problem":[75,153],"for":[76,105,169],"which":[77,189],"Karp,":[78],"Vazirani":[79,81],"gave":[82],"optimal":[84,99],"(1":[85,100],"\u2212":[86,101],"1/e)-competitive":[87,102],"algorithm":[88,104,129],"their":[90],"seminal":[91],"work":[92],"[10].":[93],"Our":[94,120],"main":[95],"result":[96],"randomized":[103],"general":[106],"vertex":[107],"weights.":[108],"use":[110],"random":[111],"perturbations":[112],"by":[115],"appropriately":[116],"chosen":[117],"multiplicative":[118],"factors.":[119],"solution":[121],"constitutes":[122],"first":[124],"generalization":[126],"[10]":[131],"model":[134],"provides":[136],"new":[137],"insights":[138],"into":[139],"role":[141],"randomization":[143],"allocation":[146],"problems.":[147],"It":[148],"also":[149],"effectively":[150],"solves":[151],"budgeted":[156],"allocations":[157],"[14]":[158],"case":[161],"when":[162,191],"agent":[164],"makes":[165],"same":[167],"bid":[168,176],"any":[170],"desired":[171],"item,":[172],"even":[173],"if":[174],"comparable":[178],"his":[180],"budget":[181],"-":[182],"complementing":[183],"results":[185],"[14,":[187],"3]":[188],"apply":[190],"bids":[193],"much":[195],"smaller":[196],"than":[197],"budgets.":[199]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":17},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2025-10-10T00:00:00"}