Search Results for author:
Found 3 papers, 1 papers with code
Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods
This problem is called the Stable Marriage problem with Ties and Incomplete preferences (SMTI).
Knowledge-Based Stable Roommates Problem: A Real-World Application
However, in real-world applications (e. g., assigning students as roommates at a dormitory), we usually consider a variety of domain-specific criteria depending on preferences over the habits and desires of the agents.
A General Framework for Stable Roommates Problems using Answer Set Programming
For that reason, there are also variations of SR that try to find a good-enough solution (e. g., Almost SR).
Cannot find the paper you are looking for? You can
Submit a new open access paper.
