Abstract
The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley [7]. Several variants and extensions to this problem have since been investigated to cover a wider set of applications. Each time a new variant is considered, however, a new algorithm needs to be developed and implemented. As an alternative, in this paper we propose an encoding of the SMP using Answer Set Programming (ASP). Our encoding can easily be extended and adapted to the needs of specific applications. As an illustration we show how stable matchings can be found when individuals may designate unacceptable partners and ties between preferences are allowed. Subsequently, we show how our ASP based encoding naturally allows us to select specific stable matchings which are optimal according to a given criterion. Each time, we can rely on generic and efficient off-the-shelf answer set solvers to find (optimal) stable matchings.
This research was funded by a Research Foundation-Flanders project.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baral, C.: Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press, New York (2003)
Brewka, G., Eiter, T., Truszczyński, M.: Answer set programming at a glance. Communications of the ACM 54(12), 92–103 (2011)
Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV. In: Gottlob, G., Walsh, T. (eds.) IJCAI, pp. 847–852. M. Kaufmann (2003)
Dung, P.: An argumentation-theoretic foundation for logic programming. The Journal of Logic Programming 22(2), 151–177 (1995)
Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Transactions on Database Systems 22(3), 364–418 (1997)
Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming 3, 499–518 (2003)
Gale, D., Shapley, L.: College admissions and the stability of marriage. The American Mathematical Monthly 69(1), 9–15 (1962)
Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discr. Appl. Math. 11, 223–232 (1985)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080 (1988)
Gusfield, D.: Three fast algorithms for four problems in stable marriage. SIAM J. Comput. 16(1), 111–128 (1987)
Irving, R.: Stable marriage and indifference. Discr. Appl. Math. 48(3), 261–272 (1994)
Irving, R.: The cycle roommates problem: a hard case of kidney exchange. Inf. Process. Lett. 103(1), 1–4 (2007)
Irving, R., Leather, P., Gusfield, D.: An efficient algorithm for the “optimal” stable marriage. J. ACM 34(3), 532–543 (1987)
Iwama, K., Miyazaki, S.: A survey of the stable marriage problem and its variants. In: Proc. of ICKS 2008, pp. 131–136. IEEE Computer Society (2008)
Janhunen, T.: Representing normal programs with clauses. In: Proc. of the 16th European Conference on Artificial Intelligence, pp. 358–362. IOS Press (2004)
Kato, A.: Complexity of the sex-equal stable marriage problem. Japan Journal of Industrial and Applied Mathematics (JJIAM) 10, 1–19 (1993)
Manlove, D.: Stable marriage with ties and unacceptable partners. Tech. rep., University of Glasgow, Department of Computing Science (1999)
Manlove, D., Irving, R., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science 276(1-2), 261–279 (2002)
Marek, V., Nerode, A., Remmel, J.: A theory of nonmonotonic rule systems I. Ann. Math. Artif. Intell. 1, 241–273 (1990)
McDermid, E., Irving, R.: Sex-equal stable matchings: Complexity and exact algorithms. Algorithmica, 1–26 (2012)
Roth, A., Sömnez, T., Ünver, M.: Pairwise kidney exchange. J. Econ. Theory 125(2), 151–188 (2005)
Roth, A., Sotomayor, M.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press (1990)
Xu, H., Li, B.: Egalitarian stable matching for VM migration in cloud computing. In: IEEE Computer Communication Workshop, pp. 631–636 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Clercq, S., Schockaert, S., De Cock, M., Nowé, A. (2013). Modeling Stable Matching Problems with Answer Set Programming. In: Morgenstern, L., Stefaneas, P., Lévy, F., Wyner, A., Paschke, A. (eds) Theory, Practice, and Applications of Rules on the Web. RuleML 2013. Lecture Notes in Computer Science, vol 8035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39617-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-39617-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39616-8
Online ISBN: 978-3-642-39617-5
eBook Packages: Computer ScienceComputer Science (R0)