{"id":"https://openalex.org/W4417081440","doi":"https://doi.org/10.48550/arxiv.2509.14466","title":"Optimal Algorithms for Bandit Learning in Matching Markets","display_name":"Optimal Algorithms for Bandit Learning in Matching Markets","publication_year":2025,"publication_date":"2025-09-17","ids":{"openalex":"https://openalex.org/W4417081440","doi":"https://doi.org/10.48550/arxiv.2509.14466"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2509.14466","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14466","pdf_url":"https://arxiv.org/pdf/2509.14466","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2509.14466","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106615110","display_name":"Tejas Pagare","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pagare, Tejas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109692339","display_name":"Agniv Bandyopadhyay","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bandyopadhyay, Agniv","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109269131","display_name":"Sandeep Juneja","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juneja, Sandeep","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.49720001220703125,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.49720001220703125,"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/T11182","display_name":"Auction Theory and Applications","score":0.15160000324249268,"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.15029999613761902,"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/matching","display_name":"Matching (statistics)","score":0.7896000146865845},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6182000041007996},{"id":"https://openalex.org/keywords/sample-complexity","display_name":"Sample complexity","score":0.6035000085830688},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.5777000188827515},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5530999898910522},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47909998893737793},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.39579999446868896},{"id":"https://openalex.org/keywords/optimal-matching","display_name":"Optimal matching","score":0.3950999975204468}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7896000146865845},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6182000041007996},{"id":"https://openalex.org/C2778445095","wikidata":"https://www.wikidata.org/wiki/Q18354077","display_name":"Sample complexity","level":2,"score":0.6035000085830688},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.5777000188827515},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5530999898910522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5394999980926514},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47909998893737793},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45719999074935913},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.421999990940094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4041999876499176},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.39579999446868896},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.3950999975204468},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.35580000281333923},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.35519999265670776},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32910001277923584},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2921999990940094},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2711000144481659},{"id":"https://openalex.org/C55479107","wikidata":"https://www.wikidata.org/wiki/Q97663916","display_name":"Stochastic approximation","level":3,"score":0.26499998569488525},{"id":"https://openalex.org/C3020318244","wikidata":"https://www.wikidata.org/wiki/Q4812187","display_name":"Large sample","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2547999918460846},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2509.14466","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14466","pdf_url":"https://arxiv.org/pdf/2509.14466","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2509.14466","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2509.14466","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2509.14466","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14466","pdf_url":"https://arxiv.org/pdf/2509.14466","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,72,110],"study":[1],"the":[2,14,95,124,134,137,145,158,172],"problem":[3],"of":[4,94,168],"pure":[5],"exploration":[6],"in":[7,44,65],"matching":[8,21,78],"markets":[9,74],"under":[10],"uncertain":[11],"preferences,":[12,100],"where":[13,50,91,105],"goal":[15],"is":[16],"to":[17,127,144],"identify":[18],"a":[19,66,112,128,166],"stable":[20,67,77],"with":[22,36,75],"confidence":[23],"parameter":[24],"$\u03b4$":[25],"and":[26,52,61,79,101,116,149],"minimal":[27],"sample":[28,85,162],"complexity.":[29,163],"Agents":[30],"learn":[31],"preferences":[32],"via":[33],"stochastic":[34],"rewards,":[35],"expected":[37],"values":[38],"indicating":[39],"preferences.":[40],"This":[41],"finds":[42],"use":[43],"labor":[45],"market":[46,96],"platforms":[47],"like":[48],"Upwork,":[49],"firms":[51],"freelancers":[53],"must":[54],"be":[55],"matched":[56],"quickly":[57],"despite":[58],"noisy":[59],"observations":[60],"no":[62],"prior":[63],"knowledge,":[64],"manner":[68],"that":[69,118,154,176],"prevents":[70],"dissatisfaction.":[71],"consider":[73],"unique":[76],"establish":[80],"information-theoretic":[81],"lower":[82,125,138,159],"bounds":[83],"on":[84,161],"complexity":[86],"for":[87,130],"(1)":[88],"one-sided":[89,131],"learning,":[90,104],"one":[92],"side":[93],"knows":[97],"its":[98],"true":[99],"(2)":[102],"two-sided":[103,146],"both":[106],"sides":[107],"are":[108],"uncertain.":[109],"propose":[111],"computationally":[113],"efficient":[114],"algorithm":[115,143,178],"prove":[117],"it":[119,155],"asymptotically":[120],"($\u03b4\\to":[121],"0$)":[122],"matches":[123,157],"bound":[126,160],"constant":[129],"learning.":[132],"Using":[133],"insights":[135],"from":[136],"bound,":[139],"we":[140,170],"extend":[141],"our":[142,177],"learning":[147],"setting":[148],"provide":[150],"experimental":[151],"results":[152],"showing":[153],"closely":[156],"Finally,":[164],"using":[165],"system":[167],"ODEs,":[169],"characterize":[171],"idealized":[173],"fluid":[174],"path":[175],"chases.":[179]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}