{"id":"https://openalex.org/W3206302766","doi":"https://doi.org/10.1145/3490486.3538328","title":"Online Bipartite Matching with Reusable Resources","display_name":"Online Bipartite Matching with Reusable Resources","publication_year":2022,"publication_date":"2022-07-12","ids":{"openalex":"https://openalex.org/W3206302766","doi":"https://doi.org/10.1145/3490486.3538328","mag":"3206302766"},"language":"en","primary_location":{"id":"doi:10.1145/3490486.3538328","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490486.3538328","pdf_url":null,"source":{"id":"https://openalex.org/S4363608973","display_name":"Proceedings of the 23rd ACM Conference on Economics and Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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 23rd ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"article","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/A5084098075","display_name":"Steven Delong","orcid":null},"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":"Steven Delong","raw_affiliation_strings":["Google, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001992185","display_name":"Alireza Farhadi","orcid":"https://orcid.org/0000-0001-7311-0567"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alireza Farhadi","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014759933","display_name":"Rad Niazadeh","orcid":"https://orcid.org/0000-0002-5880-6221"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rad Niazadeh","raw_affiliation_strings":["University of Chicago Booth School of Business, Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chicago Booth School of Business, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012130366","display_name":"Balasubramanian Sivan","orcid":"https://orcid.org/0000-0002-0188-7622"},"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":"Balasubramanian Sivan","raw_affiliation_strings":["Google Research, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8567,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.63900415,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"962","last_page":"963"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9873999953269958,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.984499990940094,"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/bipartite-graph","display_name":"Bipartite graph","score":0.8652727603912354},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7318092584609985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6537443399429321},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6436909437179565},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6378046274185181},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5849589705467224},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5666095018386841},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5429044365882874},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5025651454925537},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47718822956085205},{"id":"https://openalex.org/keywords/nothing","display_name":"Nothing","score":0.42797911167144775},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3448033928871155},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2662074863910675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19824206829071045},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06835135817527771}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8652727603912354},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7318092584609985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6537443399429321},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6436909437179565},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6378046274185181},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5849589705467224},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5666095018386841},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5429044365882874},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5025651454925537},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47718822956085205},{"id":"https://openalex.org/C136815107","wikidata":"https://www.wikidata.org/wiki/Q154242","display_name":"Nothing","level":2,"score":0.42797911167144775},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3448033928871155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2662074863910675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19824206829071045},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06835135817527771},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490486.3538328","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490486.3538328","pdf_url":null,"source":{"id":"https://openalex.org/S4363608973","display_name":"Proceedings of the 23rd ACM Conference on Economics and Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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 23rd ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1496647032","https://openalex.org/W1522394790","https://openalex.org/W1542279226","https://openalex.org/W1578666690","https://openalex.org/W1659045240","https://openalex.org/W1742759255","https://openalex.org/W1983885210","https://openalex.org/W1988278843","https://openalex.org/W1996313212","https://openalex.org/W2029945631","https://openalex.org/W2039251573","https://openalex.org/W2060049918","https://openalex.org/W2070546659","https://openalex.org/W2085938855","https://openalex.org/W2131951207","https://openalex.org/W2158268067","https://openalex.org/W2162656786","https://openalex.org/W2170675255","https://openalex.org/W2246475462","https://openalex.org/W2401584318","https://openalex.org/W2571343094","https://openalex.org/W2714991508","https://openalex.org/W2946100748","https://openalex.org/W2964219320","https://openalex.org/W2972193181","https://openalex.org/W3020987299","https://openalex.org/W3024306610","https://openalex.org/W3029111739","https://openalex.org/W3035275081","https://openalex.org/W3041591271","https://openalex.org/W3061300446","https://openalex.org/W3084028869","https://openalex.org/W3092314359","https://openalex.org/W3093588723","https://openalex.org/W3114548564","https://openalex.org/W3132506527","https://openalex.org/W3148551204","https://openalex.org/W3157300670","https://openalex.org/W3166703715","https://openalex.org/W3170106637"],"related_works":["https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2059407128","https://openalex.org/W4220981187","https://openalex.org/W2403855565","https://openalex.org/W1978382073","https://openalex.org/W3206302766","https://openalex.org/W3011788258","https://openalex.org/W205662698","https://openalex.org/W2896902984"],"abstract_inverted_index":{"We":[0,49],"study":[1],"the":[2,39,51,66],"classic":[3],"online":[4],"bipartite":[5],"matching":[6],"problem":[7],"with":[8],"a":[9,35,58],"twist:":[10],"offline":[11,20],"nodes":[12],"are":[13],"reusable":[14],"any":[15],"number":[16],"of":[17,69],"times.":[18],"Every":[19],"node":[21],"i":[22],"becomes":[23],"available":[24],"d":[25],"steps":[26],"after":[27],"it":[28],"was":[29,44],"assigned":[30],"to.":[31],"Nothing":[32],"better":[33],"than":[34],"0.5-approximation,":[36],"obtained":[37],"by":[38,61],"trivial":[40],"deterministic":[41],"greedy":[42],"algorithm,":[43],"known":[45],"for":[46],"this":[47],"problem.":[48],"give":[50],"first":[52],"approximation":[53],"factor":[54],"beating":[55],"0.5,":[56],"namely":[57],"0.505":[59],"approximation,":[60],"suitably":[62],"adapting":[63],"and":[64],"interpreting":[65],"powerful":[67],"technique":[68],"Online":[70],"Correlated":[71],"Selection.":[72]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}