# Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems

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

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 22 references that are in the map.
- First posted on arXiv 26 Jul 2025.

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

- [A General Framework for Stable Roommates Problems using Answer Set Programming](https://mlsanity.com/paper/2008.03050/) (2020)
- [Semi-Popular Matchings and Copeland Winners](https://mlsanity.com/paper/2105.13729/) (2021)
- [Knowledge-Based Stable Roommates Problem: A Real-World Application](https://mlsanity.com/paper/2108.04940/) (2021)

## Abstract (arXiv)

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). Motivated by real-world applications, and considering that stable roommates problems do not always have solutions, we continue our studies to compute "good-enough" matchings. In addition to the agents' habits and habitual preferences, we consider their networks of preferred friends, and introduce a method to generate personalized solutions to stable roommates problems. We illustrate the usefulness of our method with examples and empirical evaluations.