Knowledge-based stable roommates problem: a real-world application

Fidan, Müge and Erdem, Esra (2021) Knowledge-based stable roommates problem: a real-world application. Theory and Practice of Logic Programming, 21 (6). pp. 852-869. ISSN 1471-0684 (Print) 1475-3081 (Online)

Full text not available from this repository. (Request a copy)


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.
Item Type: Article
Uncontrolled Keywords: answer set programming; declarative problem solving; stable roommates problem
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Esra Erdem
Date Deposited: 28 Aug 2022 10:20
Last Modified: 28 Aug 2022 10:20

Actions (login required)

View Item
View Item