Knowledge-Based Stable Roommates Problem: A Real-World Application. Issue 6 (27th November 2021)

• Record Type: Journal Article
• Authors: FIDAN, MÜGE; ERDEM, ESRA
• Is Part Of: Theory and practice of logic programming. Volume 21:Issue 6(2021)
• Page Start: 852
• Page End: 869
• Publication Date: 2021-11-27
• Subjects: stable roommates problem -- answer set programming -- declarative problem solving; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068421000302
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: 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.