{"id":"https://openalex.org/W4221165155","doi":"https://doi.org/10.1145/3519935.3520046","title":"The power of multiple choices in online stochastic matching","display_name":"The power of multiple choices in online stochastic matching","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4221165155","doi":"https://doi.org/10.1145/3519935.3520046"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","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/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":true,"raw_author_name":"Zhiyi Huang","raw_affiliation_strings":["University of Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046511417","display_name":"Xinkai Shu","orcid":"https://orcid.org/0000-0002-5481-6553"},"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":"Xinkai Shu","raw_affiliation_strings":["University of Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, China","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026107997","display_name":"Shuyi Yan","orcid":"https://orcid.org/0000-0001-9439-8942"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuyi Yan","raw_affiliation_strings":["Tsinghua University, China"],"affiliations":[{"raw_affiliation_string":"Tsinghua University, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5044562275"],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":2.485,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.89209763,"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":"91","last_page":"103"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9958000183105469,"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.8039544820785522},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7313929200172424},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6898317337036133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6464922428131104},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6305592060089111},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5098901987075806},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.45234572887420654},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45127952098846436},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3255199193954468},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3245123624801636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2893717288970947},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2438809871673584},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18997618556022644},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11104965209960938},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10150513052940369}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8039544820785522},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7313929200172424},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6898317337036133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6464922428131104},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6305592060089111},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5098901987075806},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.45234572887420654},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45127952098846436},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3255199193954468},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3245123624801636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2893717288970947},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2438809871673584},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18997618556022644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11104965209960938},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10150513052940369},{"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.1145/3519935.3520046","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W122351777","https://openalex.org/W205662698","https://openalex.org/W1496647032","https://openalex.org/W1528625750","https://openalex.org/W1578666690","https://openalex.org/W2029945631","https://openalex.org/W2079669094","https://openalex.org/W2104224720","https://openalex.org/W2117702591","https://openalex.org/W2131951207","https://openalex.org/W2162656786","https://openalex.org/W2170675255","https://openalex.org/W2571343094","https://openalex.org/W2772076743","https://openalex.org/W2909539666","https://openalex.org/W2912437396","https://openalex.org/W2949565166","https://openalex.org/W2952720641","https://openalex.org/W2963337212","https://openalex.org/W3045338178","https://openalex.org/W3126370525","https://openalex.org/W3128814395","https://openalex.org/W3169625266","https://openalex.org/W3180054381","https://openalex.org/W4214878411","https://openalex.org/W4214946757","https://openalex.org/W4233282175","https://openalex.org/W4250340495"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2970577745","https://openalex.org/W2583614279","https://openalex.org/W2109659895","https://openalex.org/W4390751688"],"abstract_inverted_index":{"We":[0,96],"study":[1],"the":[2,33,61,68,73,91,99,102,115,121,128,132,136,156],"power":[3],"of":[4,15,24,32,101,106],"multiple":[5,38,52],"choices":[6,23],"in":[7,36,124,131],"online":[8,29,62],"stochastic":[9,69],"matching.":[10],"Despite":[11],"a":[12,110],"long":[13],"line":[14],"research,":[16],"existing":[17],"algorithms":[18,49,147],"still":[19],"only":[20],"consider":[21],"two":[22,43],"offline":[25],"neighbors":[26],"for":[27,45,127,135],"each":[28],"vertex":[30],"because":[31],"technical":[34],"challenge":[35],"analyzing":[37,48],"choices.":[39,53],"This":[40,113],"paper":[41],"introduces":[42],"approaches":[44],"designing":[46],"and":[47,56,71,80],"that":[50,145],"use":[51],"For":[54,83],"unweighted":[55],"vertex-weighted":[57],"matching,":[58],"we":[59,89,143],"adopt":[60],"correlated":[63],"selection":[64],"(OCS)":[65],"technique":[66],"into":[67],"setting,":[70],"improve":[72],"competitive":[74,116],"ratios":[75],"to":[76,118],"0.716,":[77],"from":[78,155],"0.711":[79],"0.7":[81],"respectively.":[82],"edge-weighted":[84,138],"matching":[85,104],"with":[86],"free":[87,141],"disposal,":[88,142],"propose":[90],"Top":[92],"Half":[93],"Sampling":[94],"algorithm.":[95],"directly":[97],"characterize":[98],"progress":[100],"whole":[103],"instead":[105],"individual":[107],"vertices,":[108],"through":[109],"differential":[111],"inequality.":[112],"improves":[114],"ratio":[117],"0.706,":[119],"breaking":[120],"1\u22121/e":[122],"barrier":[123],"this":[125,153],"setting":[126,154],"first":[129],"time":[130],"literature.":[133],"Finally,":[134],"harder":[137],"problem":[139],"without":[140],"prove":[144],"no":[146],"can":[148],"be":[149],"0.703":[150],"competitive,":[151],"separating":[152],"aforementioned":[157],"three.":[158]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}