{"id":"https://openalex.org/W4399521664","doi":"https://doi.org/10.1145/3618260.3649788","title":"Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals","display_name":"Random-Order Contention Resolution via Continuous Induction: Tightness for Bipartite Matching under Vertex Arrivals","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399521664","doi":"https://doi.org/10.1145/3618260.3649788"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649788","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649788","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649788","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649788","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027304911","display_name":"Calum MacRury","orcid":"https://orcid.org/0000-0003-0966-4332"},"institutions":[{"id":"https://openalex.org/I45029084","display_name":"City University of Seattle","ror":"https://ror.org/008a9hf75","country_code":"US","type":"education","lineage":["https://openalex.org/I4210086682","https://openalex.org/I45029084"]},{"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":"Calum MacRury","raw_affiliation_strings":["Columbia University, New York City, USA"],"raw_orcid":"https://orcid.org/0000-0003-0966-4332","affiliations":[{"raw_affiliation_string":"Columbia University, New York City, USA","institution_ids":["https://openalex.org/I45029084","https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070149920","display_name":"Will Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I45029084","display_name":"City University of Seattle","ror":"https://ror.org/008a9hf75","country_code":"US","type":"education","lineage":["https://openalex.org/I4210086682","https://openalex.org/I45029084"]},{"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":"Will Ma","raw_affiliation_strings":["Columbia University, New York City, USA"],"raw_orcid":"https://orcid.org/0000-0002-2420-4468","affiliations":[{"raw_affiliation_string":"Columbia University, New York City, USA","institution_ids":["https://openalex.org/I45029084","https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6755,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81180102,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1629","last_page":"1640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9995999932289124,"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.9995999932289124,"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.9986000061035156,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.998199999332428,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7244082093238831},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6321830153465271},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6223015189170837},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5920554399490356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4753406047821045},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4675288200378418},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4324907660484314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4226261079311371},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40276071429252625},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16473010182380676},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11571004986763},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09724748134613037}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7244082093238831},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6321830153465271},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6223015189170837},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5920554399490356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4753406047821045},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4675288200378418},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4324907660484314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4226261079311371},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40276071429252625},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16473010182380676},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11571004986763},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09724748134613037}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649788","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649788","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649788","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649788","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649788","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649788","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.6200000047683716,"id":"https://metadata.un.org/sdg/5","display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399521664.pdf","grobid_xml":"https://content.openalex.org/works/W4399521664.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W957524808","https://openalex.org/W1788659242","https://openalex.org/W2083116175","https://openalex.org/W2094067695","https://openalex.org/W2394800294","https://openalex.org/W2810576705","https://openalex.org/W2903354203","https://openalex.org/W2963159830","https://openalex.org/W3006942659","https://openalex.org/W3091384923","https://openalex.org/W3133734588","https://openalex.org/W3171990983","https://openalex.org/W3183459368","https://openalex.org/W3214604542","https://openalex.org/W4200583273","https://openalex.org/W4299785625","https://openalex.org/W4316652265","https://openalex.org/W4316652311","https://openalex.org/W4322616224","https://openalex.org/W4327810236","https://openalex.org/W4377199991","https://openalex.org/W4387724764"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2567825307","https://openalex.org/W1592682627","https://openalex.org/W4295762832","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W2054458431","https://openalex.org/W2804963084"],"abstract_inverted_index":{"We":[0,42,70],"introduce":[1],"a":[2,19,44,96,124,168,214],"new":[3],"approach":[4],"for":[5,48,82,140,159,177,220],"designing":[6],"Random-order":[7],"Contention":[8],"Resolution":[9],"Schemes":[10],"(RCRS\u2019s)":[11],"via":[12],"exact":[13,67],"solution":[14],"in":[15,74],"continuous":[16],"time.":[17],"Given":[18],"function":[20],"c(y):[0,1]":[21],"\u2192":[22,152],"[0,1],":[23],"we":[24,94,102,109,136,166,180],"show":[25,104,110],"how":[26],"to":[27,59,64,105,122,203],"select":[28],"each":[29],"element":[30],"which":[31,51,101,146,197],"arrives":[32],"at":[33,199],"time":[34,54],"y":[35],"\u2208":[36],"[0,1]":[37],"with":[38,84,91,142],"probability":[39],"exactly":[40],"c(y).":[41],"provide":[43],"rigorous":[45],"algorithmic":[46],"framework":[47,73],"achieving":[49],"this,":[50],"discretizes":[52],"the":[53,75,112,119,183,204],"interval":[55],"and":[56,193],"also":[57,103],"needs":[58],"sample":[60],"its":[61],"past":[62],"execution":[63],"ensure":[65],"these":[66],"selection":[68],"probabilities.":[69],"showcase":[71],"our":[72,133,211],"context":[76],"of":[77,114,188,206],"online":[78],"contention":[79],"resolution":[80],"schemes":[81],"matching":[83,223],"random-order":[85],"vertex":[86,230],"arrivals.":[87,231],"For":[88],"bipartite":[89,134],"graphs":[90,141,161,179,228],"two-sided":[92],"arrivals,":[93],"design":[95,137,194],"(1+e\u22122)/2":[97],"\u2248":[98,173,185],"0.567-selectable":[99],"RCRS,":[100,135],"be":[106],"tight.":[107],"Next,":[108],"that":[111],"presence":[113],"short":[115],"odd-length":[116,143],"cycles":[117],"is":[118,147,198],"only":[120],"barrier":[121],"attaining":[123],"(tight)":[125],"(1+e\u22122)/2-selectable":[126],"RCRS":[127,139,187,196],"on":[128,182,224],"general":[129,178,225],"graphs.":[130],"By":[131],"generalizing":[132],"an":[138,195],"girth":[144],"g":[145,151,163],"(1+":[148,217],"e\u22122)/2-selectable":[149],"as":[150],"\u221e.":[153],"This":[154],"convergence":[155],"happens":[156],"very":[157],"rapidly:":[158],"triangle-free":[160],"(i.e.,":[162],"\u2265":[164],"5),":[165],"attain":[167],"121/240":[169],"+":[170],"7/16":[171],"e2":[172],"0.563-selectable":[174],"RCRS.":[175],"Finally,":[176],"improve":[181],"8/15":[184],"0.533-selectable":[186],"(Fu":[189],"et":[190,208],"al.,":[191,209],"2021)":[192],"least":[200],"0.535-selectable.":[201],"Due":[202],"reduction":[205],"(Ezra":[207],"2020),":[210],"bounds":[212],"yield":[213],"0.535-competitive":[215],"(respectively,":[216,226],"e\u22122)/2-competitive)":[218],"algorithm":[219],"prophet":[221],"secretary":[222],"bipartite)":[227],"under":[229]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}