{"id":"https://openalex.org/W7164853376","doi":"https://doi.org/10.48550/arxiv.2606.13935","title":"Machine Learning-Guided Quota Optimization for Multi-Round Two-Sided Matching","display_name":"Machine Learning-Guided Quota Optimization for Multi-Round Two-Sided Matching","publication_year":2026,"publication_date":"2026-06-11","ids":{"openalex":"https://openalex.org/W7164853376","doi":"https://doi.org/10.48550/arxiv.2606.13935"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.13935","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.13935","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":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.13935","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016958272","display_name":"Omid Khormali","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khormali, Omid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138682355","display_name":"Mia Pesavento","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pesavento, Mia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.17309999465942383,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.17309999465942383,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.06239999830722809,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.05860000103712082,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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/compatibility","display_name":"Compatibility (geochemistry)","score":0.6521999835968018},{"id":"https://openalex.org/keywords/random-forest","display_name":"Random forest","score":0.4982999861240387},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4293999969959259},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.3917999863624573},{"id":"https://openalex.org/keywords/classifier","display_name":"Classifier (UML)","score":0.38989999890327454},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3441999852657318},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3366999924182892}],"concepts":[{"id":"https://openalex.org/C2778648169","wikidata":"https://www.wikidata.org/wiki/Q967768","display_name":"Compatibility (geochemistry)","level":2,"score":0.6521999835968018},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6419000029563904},{"id":"https://openalex.org/C169258074","wikidata":"https://www.wikidata.org/wiki/Q245748","display_name":"Random forest","level":2,"score":0.4982999861240387},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4293999969959259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4172999858856201},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.3917999863624573},{"id":"https://openalex.org/C95623464","wikidata":"https://www.wikidata.org/wiki/Q1096149","display_name":"Classifier (UML)","level":2,"score":0.38989999890327454},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.38089999556541443},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3441999852657318},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3366999924182892},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.33079999685287476},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32179999351501465},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3075000047683716},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2883000075817108},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.28439998626708984},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.25609999895095825}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.13935","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.13935","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"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.13935","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.13935","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":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.44484010338783264,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3],"integrated":[4],"framework":[5,44,142,194],"for":[6,63,81,161],"machine":[7],"learning-guided":[8],"quota":[9,68,136],"optimization":[10,69],"applied":[11],"to":[12,29,55,85,145,198,209,215],"multi-round":[13],"sorority":[14],"recruitment,":[15],"a":[16,33,46,77,93,109,127,175,181],"small":[17,94],"two-sided":[18,218],"market":[19],"where":[20],"approximately":[21],"100":[22],"potential":[23],"new":[24],"members":[25],"(PNMs)":[26],"are":[27],"matched":[28,102],"three":[30],"chapters":[31],"through":[32],"structured":[34],"process":[35],"governed":[36],"by":[37],"the":[38,105,115,141,165,193,204],"Release":[39],"Figure":[40],"Methodology":[41],"(RFM).":[42],"Our":[43],"combines":[45],"Random":[47],"Forest":[48],"classifier":[49],"trained":[50],"on":[51],"historical":[52],"registration":[53,124],"data":[54,91,125],"generate":[56],"PNM-chapter":[57],"compatibility":[58,106,121],"scores,":[59,140],"integer":[60],"linear":[61],"programs":[62],"Round~2":[64],"and":[65,73,76,97,132,164,180],"Round~3":[66],"invitation":[67],"balancing":[70],"fairness,":[71],"coverage,":[72],"efficiency":[74],"objectives,":[75],"Deferred":[78,166],"Acceptance":[79,167],"algorithm":[80,168],"final":[82],"matching.":[83],"Applied":[84],"five":[86],"years":[87],"of":[88,112,118,206],"de-identified":[89],"recruitment":[90,172,199],"from":[92,122],"Midwestern":[95],"university,":[96],"working":[98],"with":[99,157,174,212],"only":[100],"282":[101],"training":[103],"pairs,":[104],"model":[107],"achieves":[108],"cross-validated":[110],"ROC-AUC":[111],"0.5822,":[113],"reflecting":[114],"inherent":[116],"difficulty":[117],"predicting":[119],"social":[120],"pre-recruitment":[123],"in":[126],"data-limited":[128],"setting.":[129],"Because":[130],"fairness":[131],"coverage":[133],"constraints":[134],"dominate":[135],"allocation":[137],"under":[138],"noisy":[139],"is":[143,151,195],"designed":[144],"degrade":[146],"gracefully":[147],"when":[148],"ML":[149],"signal":[150],"weak.":[152],"Optimized":[153],"quotas":[154],"closely":[155],"align":[156],"actual":[158,170],"coordinator":[159],"decisions":[160],"active":[162],"chapters,":[163],"replicates":[169],"2025":[171],"outcomes":[173],"96.4%":[176],"individual-level":[177],"agreement":[178],"rate":[179,184],"100%":[182],"match":[183],"across":[185],"56":[186],"PNMs.":[187],"An":[188],"interactive":[189],"web":[190],"application":[191],"implementing":[192],"made":[196],"available":[197],"coordinators.":[200],"These":[201],"results":[202],"support":[203],"viability":[205],"data-driven":[207],"approaches":[208],"small-market":[210],"matching":[211],"broader":[213],"applicability":[214],"other":[216],"constrained":[217],"markets.":[219]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-16T00:00:00"}