{"id":"https://openalex.org/W2766437001","doi":"https://doi.org/10.1145/3219166.3219226","title":"Almost Optimal Stochastic Weighted Matching with Few Queries","display_name":"Almost Optimal Stochastic Weighted Matching with Few Queries","publication_year":2018,"publication_date":"2018-06-11","ids":{"openalex":"https://openalex.org/W2766437001","doi":"https://doi.org/10.1145/3219166.3219226","mag":"2766437001"},"language":"en","primary_location":{"id":"doi:10.1145/3219166.3219226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3219166.3219226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1710.10592","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soheil Behnezhad","raw_affiliation_strings":["University of Maryland, College Park, MD, USA","University of Maryland, College Park,MD,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland, College Park,MD,USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074375305","display_name":"Nima Reyhani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nima Reyhani","raw_affiliation_strings":["Upwork Inc., Mountain View, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Upwork Inc., Mountain View, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1132,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.34355243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"249"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9883999824523926,"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/T12288","display_name":"Optimization and Search Problems","score":0.9861999750137329,"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.7439984679222107},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6618485450744629},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6201227903366089},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6146653294563293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5534699559211731},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4845837354660034},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4651279151439667},{"id":"https://openalex.org/keywords/realization","display_name":"Realization (probability)","score":0.46372362971305847},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4192698895931244},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.41326069831848145},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4010104835033417}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7439984679222107},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6618485450744629},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6201227903366089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6146653294563293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5534699559211731},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4845837354660034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4651279151439667},{"id":"https://openalex.org/C2781089630","wikidata":"https://www.wikidata.org/wiki/Q21856745","display_name":"Realization (probability)","level":2,"score":0.46372362971305847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4192698895931244},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.41326069831848145},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4010104835033417},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3219166.3219226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3219166.3219226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1710.10592","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.10592","pdf_url":"https://arxiv.org/pdf/1710.10592","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":null},{"id":"doi:10.48550/arxiv.1710.10592","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1710.10592","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:2766437001","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1710.10592","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1710.10592","pdf_url":"https://arxiv.org/pdf/1710.10592","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":null},"sustainable_development_goals":[{"score":0.75,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2766437001.pdf","grobid_xml":"https://content.openalex.org/works/W2766437001.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W68213954","https://openalex.org/W1548308776","https://openalex.org/W1788659242","https://openalex.org/W1909971775","https://openalex.org/W1933599012","https://openalex.org/W2010428983","https://openalex.org/W2086698286","https://openalex.org/W2111490728","https://openalex.org/W2149744080","https://openalex.org/W2199670402","https://openalex.org/W2293140664","https://openalex.org/W2295070815","https://openalex.org/W2492999734","https://openalex.org/W2612033967","https://openalex.org/W2804737113","https://openalex.org/W2951397828","https://openalex.org/W2953027481","https://openalex.org/W2953232954","https://openalex.org/W3122360041","https://openalex.org/W4233172940","https://openalex.org/W4233190915","https://openalex.org/W4299842315"],"related_works":["https://openalex.org/W2964336535","https://openalex.org/W2899907314","https://openalex.org/W2492999734","https://openalex.org/W2497212938","https://openalex.org/W2951397828","https://openalex.org/W1758934104","https://openalex.org/W2949081789","https://openalex.org/W3128811385","https://openalex.org/W3001104546","https://openalex.org/W2994226555","https://openalex.org/W3042194019","https://openalex.org/W1537954077","https://openalex.org/W2157523155","https://openalex.org/W2952919715","https://openalex.org/W3046527477","https://openalex.org/W2952341094","https://openalex.org/W112114804","https://openalex.org/W3087854453","https://openalex.org/W3002823730","https://openalex.org/W2131263991"],"abstract_inverted_index":{"We":[0,175],"consider":[1,141],"the":[2,19,33,44,73,90,94,123,142,238,259,262,272],"stochastic":[3,81,146],"matching":[4,67,75,82],"problem.":[5],"An":[6],"edge-weighted":[7],"general":[8],"(i.e.,":[9],"not":[10],"necessarily":[11],"bipartite)":[12],"graph":[13,264],"G(V,":[14],"E)":[15],"is":[16,26,35,54,69,151,244],"given":[17],"in":[18,24,108,166],"input,":[20],"where":[21,235],"each":[22],"edge":[23],"E":[25],"realized":[27,66,78],"independently":[28],"with":[29],"probability":[30],"p":[31],";":[32],"realization":[34],"initially":[36],"unknown,":[37],"however,":[38],"we":[39,289],"are":[40,50,122],"able":[41],"to":[42,46,55,63,72,119,182,195,229,271,299],"query":[43,56],"edges":[45,62,172,191,232,282],"determine":[47],"whether":[48],"they":[49],"realized.":[51],"The":[52,80,211],"goal":[53],"only":[57,170,277],"a":[58,65,86,164,183,207,222,245,278,294],"small":[59,159],"number":[60,280],"of":[61,97,103,126,145,217,261,281,293,296,305],"find":[64],"that":[68,140,155,178,187,302],"sufficiently":[70],"close":[71,270],"maximum":[74,239],"among":[76],"all":[77],"edges.":[79],"problem":[83],"has":[84,252],"received":[85],"considerable":[87],"attention":[88],"during":[89],"past":[91],"decade":[92],"after":[93],"initial":[95],"paper":[96],"Chen":[98],"et":[99,128,132],"al.":[100,129,133],"[ICALP'09]":[101],"because":[102],"its":[104],"numerous":[105],"real-world":[106],"applications":[107],"kidney-exchange,":[109],"matchmaking":[110],"services,":[111],"online":[112],"labor":[113],"markets,":[114],"and":[115,136,138,219,251],"advertisements.":[116],"Most":[117],"relevant":[118],"our":[120,179,196,287],"work":[121],"recent":[124],"papers":[125],"Blum":[127],"[EC'15],":[130],"Assadi":[131],"[EC'16,":[134],"EC'17]":[135],"Maehara":[137,218],"Yamaguchi~[SODA'18]":[139],"same":[143],"model":[144],"matching.":[147],"Our":[148,242],"main":[149],"result":[150,243],"an":[152,253],"adaptive":[153,213],"algorithm":[154,186,216],"for":[156,203],"any":[157],"arbitrarily":[158,269],"\u03b5":[160],">":[161],"0,":[162],"finds":[163],"(1-\u03b5)-approximation":[165,223],"expectation,":[167],"by":[168,226,275],"querying":[169,227,276],"O(1)":[171],"per":[173,192,233,283],"vertex.":[174,193,284],"further":[176],"show":[177],"approach":[180],"leads":[181],"(1/2-\u03b5)-approximate":[184],"non-adaptive":[185],"also":[188],"uses":[189],"$O(1)$":[190],"Prior":[194],"work,":[197],"no":[198],"nontrivial":[199],"approximation":[200],"was":[201],"known":[202],"weighted":[204,300],"graphs":[205],"using":[206],"constant":[208,279],"per-vertex":[209],"budget.":[210],"state-of-the-art":[212],"(resp.":[214,224],"non-adaptive)":[215],"Yamaguchi":[220],"achieves":[221],"(1/2-\u03b5)-approximation)":[225],"up":[228],"O(w":[230],"\u0142ogn)":[231],"vertex":[234],"w":[236],"denotes":[237],"integer":[240],"edge-weight.":[241],"substantial":[246],"improvement":[247],"over":[248],"this":[249],"bound":[250],"appealing":[254],"message:":[255],"No":[256],"matter":[257],"what":[258],"structure":[260],"input":[263],"is,":[265],"one":[266],"can":[267],"get":[268],"optimum":[273],"solution":[274],"To":[285],"obtain":[286],"results,":[288],"introduce":[290],"novel":[291],"properties":[292],"generalization":[295],"augmenting":[297],"paths":[298],"matchings":[301],"may":[303],"be":[304],"independent":[306],"interest.":[307]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}