Hostname: page-component-89b8bd64d-nlwjb Total loading time: 0 Render date: 2026-05-06T09:17:41.266Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  27 September 2021

MÜGE FIDAN Open the ORCID record for MÜGE FIDAN [Opens in a new window]  and
ESRA ERDEM Open the ORCID record for ESRA ERDEM [Opens in a new window]
MÜGE FIDAN
Affiliation:
Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey (e-mails: mugefidan@sabanciuniv.edu, esra.erdem@sabanciuniv.edu)
ESRA ERDEM
Affiliation:
Faculty of Engineering and Natural Sciences, Sabanci University, Istanbul, Turkey (e-mails: mugefidan@sabanciuniv.edu, esra.erdem@sabanciuniv.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Keywords

stable roommates problemanswer set programmingdeclarative problem solving

Information

Type
Original Article
Information
Theory and Practice of Logic Programming , Volume 21 , Special Issue 6: 37th International Conference on Logic Programming Special Issue II , November 2021 , pp. 852 - 869
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press

References

Abraham, D. J., Biró, P. and Manlove, D. F. 2005. “almost stable” matchings in the roommates problem. In International Workshop on Approximation and Online Algorithms. Springer, 1–14.Google Scholar
Boehmer, N. and Elkind, E. 2020. Stable Roommate Problem With Diversity Preferences. In Proceeding of AAMAS, 1780–-1782.Google Scholar
Brewka, G., Eiter, T. and Truszczynski, M. 2016. Answer set programming: An introduction to the special issue. AI Magazine 37, 3, 5–6.10.1609/aimag.v37i3.2669CrossRefGoogle Scholar
Cooper, F. 2020. Fair and large stable matchings in the stable marriage and student-project allocation problems. Ph.D. thesis, University of Glasgow.Google Scholar
Erdem, E., Fidan, M., Manlove, D. and Prosser, P. 2020. A general framework for stable roommates problems using answer set programming. Theory and Practice of Logic Programming 20, 6, 911–925.10.1017/S1471068420000277CrossRefGoogle Scholar
Erdös, P. and Rényi, A. 1960. On the evolution of random graphs. In Publication of the Mathematical Institute of the Hungarian Academy of Sciences. 17–61.Google Scholar
Feder, T. 1992. A new fixed point approach for stable networks and stable marriages. Journal of Computer and System Sciences 45, 2, 233–284.10.1016/0022-0000(92)90048-NCrossRefGoogle Scholar
Gale, D. and Shapley, L. S. 1962. College admissions and the stability of marriage. The American Mathematical Monthly 69, 1, 9–15.10.1080/00029890.1962.11989827CrossRefGoogle Scholar
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of ICLP. MIT Press, 1070–1080.Google Scholar
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385.10.1007/BF03037169CrossRefGoogle Scholar
Gusfield, D. and Irving, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA, USA.Google Scholar
Irving, R. W. and Manlove, D. F. 2002. The stable roommates problem with ties. Journal of Algorithms 43, 1, 85–105.10.1006/jagm.2002.1219CrossRefGoogle Scholar
Irving, R. W., Manlove, D. F. and O’Malley, G. 2009. Stable marriage with ties and bounded length preference lists. Journal of Discrete Algorithms 7, 2, 213–219.10.1016/j.jda.2008.09.003CrossRefGoogle Scholar
Lifschitz, V. 2002. Answer set programming and plan generation. Artificial Intelligence 138, 39–54.10.1016/S0004-3702(02)00186-8CrossRefGoogle Scholar
Marek, V. and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. Springer Verlag, 375–398.10.1007/978-3-642-60085-2_17CrossRefGoogle Scholar
Mertens, S. 2005. Random stable matchings. Journal of Statistical Mechanics: Theory and Experiment 2005, 10, P10008.10.1088/1742-5468/2005/10/P10008CrossRefGoogle Scholar
Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241–273.10.1023/A:1018930122475CrossRefGoogle Scholar
Ronn, E. 1990. NP-complete stable matching problems. Journal of Algorithms 11, 2, 285–304.10.1016/0196-6774(90)90007-2CrossRefGoogle Scholar