# Knowledge-Based Stable Roommates Problem: A Real-World Application

arXiv: https://arxiv.org/abs/2108.04940 · HTML: https://mlsanity.com/paper/2108.04940/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 20 references that are in the map.
- First posted on arXiv 10 Aug 2021.

## Builds on (most cited first, 2 of 2)

- [A General Framework for Stable Roommates Problems using Answer Set Programming](https://mlsanity.com/paper/2008.03050/) (2020)
- [Stable Roommate Problem with Diversity Preferences](https://mlsanity.com/paper/2004.14640/) (2020)

## Built on by (most cited first, 1 of 1)

- [Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems](https://mlsanity.com/paper/2507.20010/) (2025)

## Abstract (arXiv)

The Stable Roommates problem with Ties and Incomplete lists (SRTI) is a matching problem characterized by the preferences of agents over other agents as roommates, where the preferences may have ties or be incomplete. SRTI asks for a matching that is stable and, sometimes, optimizes a domain-independent fairness criterion (e.g., Egalitarian). 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. With this motivation, we introduce a knowledge-based method to SRTI considering domain-specific knowledge, and investigate its real-world application for assigning students as roommates at a university dormitory. This paper is under consideration for acceptance in Theory and Practice of Logic Programming (TPLP).