2 papers
cs.DS2025
Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
Baturay Yılmaz, Esra Erdem
While the existence of a stable matching for the stable roommates problem possibly with incomplete preference lists (SRI) can be decided in polynomial time, SRI problems with some…
cs.AI2021
Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods
Selin Eyupoglu, Muge Fidan, Yavuz Gulesen +5
We study a variation of the Stable Marriage problem, where every man and every woman express their preferences as preference lists which may be incomplete and contain ties. This pr…