Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912504072896512 |
|---|---|
| author | Fidan, Müge Erdem, Esra |
| author_facet | Fidan, Müge Erdem, Esra |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_20010 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems Fidan, Müge Erdem, Esra Artificial Intelligence Computer Science and Game Theory Logic in Computer Science 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. |
| title | Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems |
| topic | Artificial Intelligence Computer Science and Game Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2507.20010 |