{"id":"https://openalex.org/W7147514920","doi":"https://doi.org/10.48550/arxiv.2603.26943","title":"Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings","display_name":"Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings","publication_year":2026,"publication_date":"2026-03-27","ids":{"openalex":"https://openalex.org/W7147514920","doi":"https://doi.org/10.48550/arxiv.2603.26943"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.26943","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26943","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.26943","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101427454","display_name":"Christine T. Cheng","orcid":"https://orcid.org/0000-0003-0524-5368"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheng, Christine T.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5050493171","display_name":"Will Rosenbaum","orcid":"https://orcid.org/0000-0002-7723-9090"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rosenbaum, Will","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.946399986743927,"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.946399986743927,"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/T10585","display_name":"Family Dynamics and Relationships","score":0.016899999231100082,"subfield":{"id":"https://openalex.org/subfields/3317","display_name":"Demography"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0035000001080334187,"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/stable-marriage-problem","display_name":"Stable marriage problem","score":0.7706000208854675},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6014999747276306},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.47769999504089355},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41179999709129333},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.3237000107765198},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.3206999897956848},{"id":"https://openalex.org/keywords/bridging","display_name":"Bridging (networking)","score":0.3203999996185303}],"concepts":[{"id":"https://openalex.org/C146393371","wikidata":"https://www.wikidata.org/wiki/Q620702","display_name":"Stable marriage problem","level":3,"score":0.7706000208854675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6694999933242798},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6277999877929688},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6014999747276306},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.47769999504089355},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35749998688697815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33410000801086426},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C174348530","wikidata":"https://www.wikidata.org/wiki/Q188635","display_name":"Bridging (networking)","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.301800012588501},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2587999999523163}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.26943","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26943","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":"doi:10.48550/arxiv.2603.26943","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.26943","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/5","score":0.588142991065979,"display_name":"Gender equality"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,104],"the":[1,46,64,74,77,90,96,123,136,184],"Stable":[2,91],"Roommates":[3],"Problem":[4,93],"(SR),":[5],"a":[6,15,23,69,109],"set":[7],"of":[8,33,48,59,76,111],"$2n$":[9],"agents":[10,34],"rank":[11],"one":[12,28],"another":[13],"in":[14,89,179],"linear":[16],"order.":[17],"The":[18],"goal":[19,65],"is":[20,26,66,98,138,189],"to":[21,67,141,151,195],"find":[22,68,152],"matching":[24,71,88,156,175,187],"that":[25,29,72,162],"stable:":[27],"has":[30,131,167],"no":[31],"pair":[32],"who":[35],"mutually":[36],"prefer":[37],"each":[38,58],"other":[39],"over":[40],"their":[41,60],"assigned":[42],"partners.":[43],"We":[44],"consider":[45],"problem":[47,97,188],"finding":[49,84],"an":[50,85,128,142,153,164,172],"optimal":[51,86,154,173,185],"stable":[52,70,87,155,174,186],"matching.":[53],"Agents":[54],"associate":[55],"weights":[56],"with":[57,193],"potential":[61],"partners,":[62],"and":[63,117,145],"minimizes":[73],"sum":[75],"associated":[78],"weights.":[79],"Efficient":[80],"algorithms":[81],"exist":[82],"for":[83,100],"Marriage":[92],"(SM),":[94],"but":[95],"NP-hard":[99],"general":[101],"SR":[102,115,129,165],"instances.":[103],"this":[105,146],"paper,":[106],"we":[107,121,160],"define":[108],"notion":[110],"structural":[112],"distance":[113,134,170],"between":[114],"instances":[116],"SM":[118,143],"instances,":[119],"which":[120],"call":[122],"minimum":[124,132,168,196],"crossing":[125,133,169,197],"distance.":[126,198],"When":[127],"instance":[130,137,166],"$0$,":[135],"structurally":[139],"equivalent":[140],"instance,":[144],"structure":[147],"can":[148,176],"be":[149,177],"exploited":[150],"efficiently.":[157],"More":[158],"generally,":[159],"show":[161],"when":[163],"$k$,":[171],"computed":[178],"time":[180],"$2^{O(k)}":[181],"n^{O(1)}$.":[182],"Thus,":[183],"fixed-parameter":[190],"tractable":[191],"(FPT)":[192],"respect":[194]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}