{"id":"https://openalex.org/W2492999734","doi":"https://doi.org/10.1145/2940716.2940769","title":"The Stochastic Matching Problem with (Very) Few Queries","display_name":"The Stochastic Matching Problem with (Very) Few Queries","publication_year":2016,"publication_date":"2016-07-21","ids":{"openalex":"https://openalex.org/W2492999734","doi":"https://doi.org/10.1145/2940716.2940769","mag":"2492999734"},"language":"en","primary_location":{"id":"doi:10.1145/2940716.2940769","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2940716.2940769","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2940769&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2940769&type=pdf","any_repository_has_fulltext":null},"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/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sepehr Assadi","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"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/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100658046","display_name":"Yang Li","orcid":"https://orcid.org/0000-0002-7680-4959"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Li","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060978295"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":3.8392,"has_fulltext":true,"cited_by_count":34,"citation_normalized_percentile":{"value":0.93960337,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9958000183105469,"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.9958000183105469,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9922999739646912,"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/T10237","display_name":"Cryptography and Data Security","score":0.987500011920929,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8484646677970886},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7345706820487976},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5795168280601501},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5739386677742004},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5112857818603516},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4776688516139984},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.45866456627845764},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4440373480319977},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40914633870124817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3275306820869446},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32419654726982117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3045896291732788},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1179577112197876},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06823736429214478}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8484646677970886},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7345706820487976},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5795168280601501},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5739386677742004},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5112857818603516},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4776688516139984},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.45866456627845764},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4440373480319977},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40914633870124817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3275306820869446},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32419654726982117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3045896291732788},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1179577112197876},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06823736429214478},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2940716.2940769","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2940716.2940769","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2940769&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Economics and Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:alma.01RUT_INST:11663596290004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/The-Stochastic-Matching-Problem-with-Very/991031654938404646","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":"Conference Proceedings"}],"best_oa_location":{"id":"doi:10.1145/2940716.2940769","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2940716.2940769","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2940769&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Conference on Economics and Computation","raw_type":"proceedings-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/G1822506015","display_name":null,"funder_award_id":"CCF-1116961, CCF-1552909, 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/W2492999734.pdf","grobid_xml":"https://content.openalex.org/works/W2492999734.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W68213954","https://openalex.org/W178538629","https://openalex.org/W1639030016","https://openalex.org/W1788659242","https://openalex.org/W1909971775","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/W2109309849","https://openalex.org/W2111490728","https://openalex.org/W2149744080","https://openalex.org/W2162740996","https://openalex.org/W2199670402","https://openalex.org/W2258899852","https://openalex.org/W2293140664","https://openalex.org/W2295070815","https://openalex.org/W2295455748","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/W4299842315"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W2945016732","https://openalex.org/W2785998768","https://openalex.org/W2352066879","https://openalex.org/W1592682627","https://openalex.org/W2054458431","https://openalex.org/W2348257368","https://openalex.org/W4295762832","https://openalex.org/W2371352078","https://openalex.org/W2362975861"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"an":[2],"application":[3],"in":[4,26,46,52,62,64],"kidney":[5],"exchange,":[6],"we":[7,14],"study":[8],"the":[9,38,47],"following":[10],"stochastic":[11],"matching":[12,45],"problem:":[13],"are":[15,72],"given":[16],"a":[17,43],"graph":[18],"G(V,E)":[19],"(not":[20],"necessarily":[21],"bipartite),":[22],"where":[23],"each":[24],"edge":[25],"E":[27,63],"is":[28,40,55],"realized":[29,48],"with":[30],"some":[31],"constant":[32],"probability":[33],"p":[34],">":[35],"0":[36],"and":[37],"goal":[39],"to":[41,57,60,66],"find":[42],"maximum":[44],"graph.":[49],"An":[50],"algorithm":[51],"this":[53],"setting":[54],"allowed":[56],"make":[58],"queries":[59],"edges":[61],"order":[65],"determine":[67],"whether":[68],"or":[69],"not":[70],"they":[71],"realized.":[73]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}