{"id":"https://openalex.org/W7131390809","doi":"https://doi.org/10.48550/arxiv.2602.20358","title":"Efficient Interview Scheduling for Stable Matching","display_name":"Efficient Interview Scheduling for Stable Matching","publication_year":2026,"publication_date":"2026-02-23","ids":{"openalex":"https://openalex.org/W7131390809","doi":"https://doi.org/10.48550/arxiv.2602.20358"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.20358","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090426330","display_name":"Moshe Babaioff","orcid":"https://orcid.org/0000-0002-7066-2005"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Babaioff, Moshe","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126780296","display_name":"Rotem Gil","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gil, Rotem","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5073660616","display_name":"Assaf Romm","orcid":"https://orcid.org/0000-0003-3685-9274"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Romm, Assaf","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090426330"],"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9265999794006348,"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"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9265999794006348,"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/T11182","display_name":"Auction Theory and Applications","score":0.04560000076889992,"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/T12288","display_name":"Optimization and Search Problems","score":0.009399999864399433,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6148999929428101},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49070000648498535},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"Stable marriage problem","score":0.47510001063346863},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.41990000009536743},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3549000024795532},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.33070001006126404}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6148999929428101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6104999780654907},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49070000648498535},{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.47510001063346863},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.41990000009536743},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40709999203681946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39419999718666077},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3549000024795532},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.33070001006126404},{"id":"https://openalex.org/C24845683","wikidata":"https://www.wikidata.org/wiki/Q178651","display_name":"Interview","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2791000008583069},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.2786000072956085},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2599000036716461}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.20358","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.20358","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.20358","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.20358","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"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":{"The":[0],"study":[1],"of":[2,70,76,168],"stable":[3],"matchings":[4],"usually":[5],"relies":[6],"on":[7,109,118],"the":[8,14,67,73,119,125,160,182],"assumption":[9],"that":[10,84,97,124,140,143,159],"agents'":[11],"preferences":[12,26],"over":[13],"opposite":[15],"side":[16],"are":[17,113,199],"complete":[18],"and":[19,30,54,72,91,105],"known.":[20],"In":[21],"many":[22],"real":[23],"markets,":[24],"however,":[25],"might":[27],"be":[28],"uncertain":[29],"revealed":[31],"only":[32,164,173],"through":[33],"costly":[34],"interactions":[35],"such":[36],"as":[37],"interviews.":[38],"We":[39,79,135,156],"show":[40,123],"how":[41],"to":[42],"reach":[43],"interim-stable":[44,86,190],"matchings,":[45],"under":[46],"which":[47],"all":[48,197],"matched":[49],"pairs":[50],"must":[51],"have":[52],"interviewed":[53],"agents":[55,112,117],"use":[56],"expected":[57,68,74,166],"utilities":[58],"whenever":[59],"true":[60],"values":[61],"remain":[62],"unknown,":[63],"while":[64,170],"minimizing":[65],"both":[66],"number":[69,75,167],"interviews":[71,102,130,148,176,183,198],"interview":[77],"rounds.":[78],"introduce":[80],"two":[81],"adaptive":[82],"algorithms":[83,187],"produce":[85],"matchings:":[87],"one":[88],"operates":[89],"sequentially,":[90],"another":[92],"is":[93,194],"a":[94],"hybrid":[95,161],"algorithm":[96,127,142,162],"begins":[98],"by":[99,138,185],"scheduling":[100],"some":[101],"in":[103,133,179],"parallel":[104],"continues":[106],"sequentially.":[107],"Focusing":[108],"cases":[110],"where":[111],"ex-ante":[114],"indifferent":[115],"between":[116],"other":[120],"side,":[121],"we":[122],"sequential":[126],"performs":[128,144],"2":[129,147,175],"per":[131,149,177],"agent":[132,178],"expectation.":[134,180],"complement":[136],"this":[137],"showing":[139],"any":[141],"less":[145],"than":[146],"agent,":[150],"does":[151],"not":[152],"always":[153],"guarantee":[154,188],"interim-stability.":[155],"also":[157],"demonstrate":[158],"requires":[163],"polylogarithmic":[165],"rounds,":[169],"still":[171],"performing":[172],"about":[174],"Additionally,":[181],"scheduled":[184],"our":[186],"an":[189],"matching":[191],"when":[192],"Deferred-Acceptance":[193],"run":[195],"after":[196],"completed.":[200]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-26T00:00:00"}