{"id":"https://openalex.org/W3177979674","doi":"https://doi.org/10.1145/3465456.3467530","title":"Designing Approximately Optimal Search on Matching Platforms","display_name":"Designing Approximately Optimal Search on Matching Platforms","publication_year":2021,"publication_date":"2021-07-18","ids":{"openalex":"https://openalex.org/W3177979674","doi":"https://doi.org/10.1145/3465456.3467530","mag":"3177979674"},"language":"en","primary_location":{"id":"doi:10.1145/3465456.3467530","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3465456.3467530","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3465456.3467530","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd 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":"https://dl.acm.org/doi/pdf/10.1145/3465456.3467530","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009111822","display_name":"Nicole Immorlica","orcid":"https://orcid.org/0000-0003-4180-4657"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nicole Immorlica","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082964830","display_name":"Brendan Lucier","orcid":"https://orcid.org/0009-0006-3497-0875"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brendan Lucier","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049724534","display_name":"Vahideh Manshadi","orcid":"https://orcid.org/0000-0001-9103-7797"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vahideh Manshadi","raw_affiliation_strings":["Yale University, New Haven, CT, USA"],"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064061424","display_name":"Alexander Wei","orcid":"https://orcid.org/0000-0002-4295-5361"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Wei","raw_affiliation_strings":["University of California, Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5009111822"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.5228,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.67878466,"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":"632","last_page":"633"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9983999729156494,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12137","display_name":"Economic theories and models","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6103307604789734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5498846769332886},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5268087387084961},{"id":"https://openalex.org/keywords/cannibalization","display_name":"Cannibalization","score":0.5079494118690491},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.49175432324409485},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4906536638736725},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.46332094073295593},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.4323713779449463},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4159896969795227},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.384390264749527},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2849217355251312},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2834446430206299},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2483077347278595},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.14247500896453857},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1196201741695404}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6103307604789734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5498846769332886},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5268087387084961},{"id":"https://openalex.org/C2777538425","wikidata":"https://www.wikidata.org/wiki/Q1154300","display_name":"Cannibalization","level":2,"score":0.5079494118690491},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.49175432324409485},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4906536638736725},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.46332094073295593},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.4323713779449463},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4159896969795227},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.384390264749527},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2849217355251312},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2834446430206299},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2483077347278595},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.14247500896453857},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1196201741695404},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C40700","wikidata":"https://www.wikidata.org/wiki/Q1411783","display_name":"Industrial organization","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3465456.3467530","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3465456.3467530","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3465456.3467530","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM Conference on Economics and Computation","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3465456.3467530","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3465456.3467530","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3465456.3467530","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6499999761581421}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320336061","display_name":"Research England","ror":"https://ror.org/02wxr8x18"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3177979674.pdf","grobid_xml":"https://content.openalex.org/works/W3177979674.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2120574761","https://openalex.org/W1488845133","https://openalex.org/W2026772368","https://openalex.org/W2777578733","https://openalex.org/W2784188386","https://openalex.org/W2606336213","https://openalex.org/W2143559000","https://openalex.org/W2061420013","https://openalex.org/W2020053772","https://openalex.org/W2035433397"],"abstract_inverted_index":{"We":[0,103,122],"study":[1],"the":[2,17,43,46,51,60,69,90,106,133,153,183,205,214],"design":[3,134,160],"of":[4,22,24,57,100,152,171,216],"a":[5,84,97,226],"decentralized":[6],"two-sided":[7],"matching":[8],"market":[9],"in":[10,83],"which":[11,112],"agents'":[12],"search":[13,47,110,159,181,220],"is":[14,21,161,203,221],"guided":[15],"by":[16,49,211],"platform.":[18],"Each":[19],"agent":[20],"one":[23],"finitely":[25],"many":[26],"types":[27,58],"and":[28,130,163,189],"has":[29],"(potentially":[30],"random)":[31],"preferences":[32,82],"drawn":[33],"from":[34,59,128],"known":[35],"type-specific":[36],"distributions.":[37],"Equipped":[38],"with":[39,179,194],"such":[40],"distributional":[41],"knowledge,":[42],"platform":[44,184],"guides":[45],"process":[48],"determining":[50],"meeting":[52,101,115],"rate":[53],"between":[54],"each":[55],"pair":[56],"two":[61],"sides.":[62],"Meanwhile,":[63],"agents":[64,78],"strategically":[65],"accept":[66],"or":[67],"reject":[68],"potential":[70],"partners":[71],"whom":[72],"they":[73],"meet.":[74],"Focusing":[75],"on":[76],"when":[77],"have":[79],"symmetric":[80],"pairwise":[81],"continuum":[85],"model,":[86],"we":[87,139,199,207],"first":[88],"characterize":[89],"unique":[91],"stationary":[92],"equilibrium":[93,119,147,193],"that":[94,124,201,213],"arises":[95],"given":[96],"feasible":[98],"set":[99],"rates.":[102],"then":[104],"introduce":[105],"platform's":[107],"optimal":[108,154,196,218],"directed":[109,158,219],"problem,":[111],"involves":[113],"optimizing":[114],"rates":[116],"to":[117,223],"maximize":[118],"social":[120,155],"welfare.":[121,156,197],"show":[123,200],"incentive":[125],"issues":[126],"arising":[127],"congestion":[129],"cannibalization":[131],"make":[132],"problem":[135,215],"fairly":[136],"intricate.":[137],"Nonetheless,":[138],"develop":[140],"an":[141,192],"efficiently":[142],"computable":[143],"solution":[144,176],"whose":[145],"corresponding":[146,167],"achieves":[148],"at":[149],"least":[150],"1/4":[151],"Our":[157],"simple":[162],"easy-to-implement,":[164],"as":[165],"its":[166],"bipartite":[168],"graph":[169],"consists":[170],"disjoint":[172],"stars.":[173],"Furthermore,":[174],"our":[175],"implies":[177],"that,":[178],"careful":[180],"design,":[182],"can":[185,208],"substantially":[186],"limit":[187],"choice":[188],"yet":[190],"induce":[191],"approximately":[195],"Finally,":[198],"approximation":[202],"likely":[204],"best":[206],"hope":[209],"for":[210],"establishing":[212],"designing":[217],"NP-hard":[222],"approximate":[224],"beyond":[225],"certain":[227],"constant":[228],"factor.":[229]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"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"}