Knowledge-Based Stable Roommates Problems

The Stable Roommates problems are characterized by the preferences of agents over other agents as roommates. A solution is a partition of the agents into pairs that are acceptable to each other (i.e., they are in the preference lists of each other), and the matching is stable (i.e., there do not exist any two agents who prefer each other to their roommates, and thus block the matching). This study focuses on a human-centered and computationallychallenging interdisciplinary problem of the Stable Roommates problem and its variations. Motivated by realworld applications, and considering that stable roommates problems do not always have solutions, the goal is to develop novel computational methods to solve these problems, that are not only computationally efficient but also applicable in real-world to benefit humans.