Modeling Stable Matching Problems with Answer Set Programming
The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley . 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.
KeywordsStable Matchings Aggregate Function Preference List Virtual Machine Migration Kidney Exchange
Unable to display preview. Download preview PDF.
- 3.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)Google Scholar
- 9.Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080 (1988)Google Scholar
- 14.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)Google Scholar
- 15.Janhunen, T.: Representing normal programs with clauses. In: Proc. of the 16th European Conference on Artificial Intelligence, pp. 358–362. IOS Press (2004)Google Scholar
- 17.Manlove, D.: Stable marriage with ties and unacceptable partners. Tech. rep., University of Glasgow, Department of Computing Science (1999)Google Scholar
- 20.McDermid, E., Irving, R.: Sex-equal stable matchings: Complexity and exact algorithms. Algorithmica, 1–26 (2012)Google Scholar
- 22.Roth, A., Sotomayor, M.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press (1990)Google Scholar
- 23.Xu, H., Li, B.: Egalitarian stable matching for VM migration in cloud computing. In: IEEE Computer Communication Workshop, pp. 631–636 (2011)Google Scholar