{"id":"https://openalex.org/W3014538798","doi":"https://doi.org/10.1145/3355903","title":"The Stochastic Matching Problem with (Very) Few Queries","display_name":"The Stochastic Matching Problem with (Very) Few Queries","publication_year":2019,"publication_date":"2019-08-31","ids":{"openalex":"https://openalex.org/W3014538798","doi":"https://doi.org/10.1145/3355903","mag":"3014538798"},"language":"en","primary_location":{"id":"doi:10.1145/3355903","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3355903","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3355903","source":{"id":"https://openalex.org/S4210173995","display_name":"ACM Transactions on Economics and Computation","issn_l":"2167-8375","issn":["2167-8375","2167-8383"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Economics and Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3355903","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060978295","display_name":"Sepehr Assadi","orcid":"https://orcid.org/0009-0006-8914-5995"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania","institution_ids":["https://openalex.org/I36788626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania","institution_ids":["https://openalex.org/I36788626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100421738","display_name":"Yang Li","orcid":"https://orcid.org/0000-0003-1812-3829"},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Li","raw_affiliation_strings":["University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania","institution_ids":["https://openalex.org/I36788626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060978295"],"corresponding_institution_ids":["https://openalex.org/I36788626"],"apc_list":null,"apc_paid":null,"fwci":0.4335,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.73904315,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":"3","first_page":"1","last_page":"19"},"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.9965999722480774,"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.9965999722480774,"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/T10237","display_name":"Cryptography and Data Security","score":0.9884999990463257,"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.9878000020980835,"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/bipartite-graph","display_name":"Bipartite graph","score":0.6903371214866638},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6689817905426025},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5799657106399536},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5701342821121216},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5086246728897095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5063294172286987},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4603024125099182},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4277487099170685},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42420700192451477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3535236716270447},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32085415720939636}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6903371214866638},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6689817905426025},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5799657106399536},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5701342821121216},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5086246728897095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5063294172286987},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4603024125099182},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4277487099170685},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42420700192451477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3535236716270447},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32085415720939636},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3355903","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3355903","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3355903","source":{"id":"https://openalex.org/S4210173995","display_name":"ACM Transactions on Economics and Computation","issn_l":"2167-8375","issn":["2167-8375","2167-8383"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Economics and Computation","raw_type":"journal-article"},{"id":"pmh:oai:alma.01RUT_INST:11663514280004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/The-Stochastic-Matching-Problem-with-Very/991031654740604646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"}],"best_oa_location":{"id":"doi:10.1145/3355903","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3355903","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3355903","source":{"id":"https://openalex.org/S4210173995","display_name":"ACM Transactions on Economics and Computation","issn_l":"2167-8375","issn":["2167-8375","2167-8383"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Economics and Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1446585944","display_name":null,"funder_award_id":"CCF-1116961, CCF-1552909, and IIS-1447470","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2042962623","display_name":null,"funder_award_id":"IIS-1447470","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3836774721","display_name":null,"funder_award_id":"CCF-1116961","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4099463206","display_name":"AF: EAGER: Small Space Algorithms and Representations for Graph Optimization Problems","funder_award_id":"1552909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4802997597","display_name":"BIGDATA: F: DKM: Spectral Analysis and Control of Evolving Large Scale Networks","funder_award_id":"1447470","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8125655185","display_name":"AF: Small: Cut, Flow, and Matching Problems in Graphs","funder_award_id":"1116961","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8836207540","display_name":null,"funder_award_id":"CCF-1552909","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3014538798.pdf","grobid_xml":"https://content.openalex.org/works/W3014538798.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W68213954","https://openalex.org/W1548308776","https://openalex.org/W1788659242","https://openalex.org/W1965765215","https://openalex.org/W1973497222","https://openalex.org/W2010428983","https://openalex.org/W2012193618","https://openalex.org/W2038521541","https://openalex.org/W2086698286","https://openalex.org/W2149744080","https://openalex.org/W2162740996","https://openalex.org/W2492999734","https://openalex.org/W2612033967","https://openalex.org/W2614365644","https://openalex.org/W2962958397","https://openalex.org/W2964336535","https://openalex.org/W3121213783","https://openalex.org/W3122360041","https://openalex.org/W3123258615","https://openalex.org/W4233172940","https://openalex.org/W4233190915","https://openalex.org/W4240416043","https://openalex.org/W4241765972","https://openalex.org/W4242907262","https://openalex.org/W4246633356","https://openalex.org/W4252630569","https://openalex.org/W4299842315"],"related_works":["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","https://openalex.org/W2963158951"],"abstract_inverted_index":{"Motivated":[0],"by":[1,214,218],"an":[2,79,191,210],"application":[3,263],"in":[4,31,51,57,67,96,125,158,245,267],"kidney":[5,268],"exchange":[6],",":[7,90],"we":[8],"study":[9],"the":[10,43,52,97,118,171,176,204,231,249,261],"following":[11],"stochastic":[12,265],"matching":[13,50,95,157,266],"problem:":[14],"We":[15,77,134,270],"are":[16,75,122],"given":[17],"a":[18,48,92,137,154,221],"graph":[19,88,99],"G":[20,89,100,159],"(":[21],"V,":[22],"E":[23,32,68],")":[24,113,132,148],"(not":[25],"necessarily":[26],"bipartite),":[27],"where":[28,117],"each":[29],"edge":[30],"is":[33,45,60,237,248,256],"realized":[34,53,98],"with":[35,102,161],"some":[36],"constant":[37],"probability":[38],"p":[39,101,110,112,129,131,145,147,160,228],">":[40],"0,":[41],"and":[42,152,167,227,279],"goal":[44],"to":[46,62,65,69,120,241,260],"find":[47],"maximum":[49,94,156],"graph.":[54],"An":[55],"algorithm":[56,81,139],"this":[58,83,187],"setting":[59],"allowed":[61],"make":[63],"queries":[64,114,149,197,202],"edges":[66,119],"determine":[70],"whether":[71],"or":[72],"not":[73],"they":[74],"realized.":[76],"design":[78],"adaptive":[80,166,201,205],"for":[82,86,186,203,251],"problem":[84,212],"that,":[85],"any":[87],"computes":[91,153],"(1\u2212\u03b5)-approximate":[93],"high":[103,162],"probability,":[104],"while":[105,189],"making":[106],"O":[107,126,142],"(log":[108,127,143],"(1/\u03b5":[109,128,144],")/\u03b5":[111,130,146],"per":[115,150],"vertex,":[116],"query":[121],"chosen":[123],"adaptively":[124],"rounds.":[133],"further":[135],"present":[136],"non-adaptive":[138,168],"that":[140],"makes":[141],"vertex":[151,280],"(1/2\u2212\u03b5)-approximate":[155],"probability.":[163],"Both":[164],"our":[165,235,272],"algorithms":[169,179,236],"achieve":[170],"same":[172],"approximation":[173,232],"factor":[174],"as":[175,239,247],"previous":[177],"best":[178],"of":[180,195,200,234,257,264,285],"Blum":[181,215,252],"et":[182,216,253],"al.":[183,217,254],"(EC":[184],"2015)":[185],"problem,":[188],"requiring":[190],"exponentially":[192],"smaller":[193],"number":[194],"per-vertex":[196],"(and":[198],"rounds":[199],"algorithm).":[206],"Our":[207],"results":[208,273],"settle":[209],"open":[211],"raised":[213],"achieving":[219],"only":[220,242],"polynomial":[222],"dependency":[223],"on":[224],"both":[225],"\u03b5":[226],".":[229],"Moreover,":[230],"guarantee":[233],"instance-wise":[238],"opposed":[240],"being":[243],"competitive":[244],"expectation":[246],"case":[250],"This":[255],"particular":[258],"relevance":[259],"key":[262],"exchange.":[269],"obtain":[271],"via":[274],"two":[275],"main":[276],"techniques\u2014namely,":[277],"matching-covers":[278],"sparsification":[281],"\u2014that":[282],"may":[283],"be":[284],"independent":[286],"interest.":[287]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}