Modeling stable matching problems with answer set programming

Authors:
Sofie De Clercq;Steven Schockaert;Martine De Cock;Ann Nowé
Affiliations:
Dept. of Applied Math., CS & Stats, Ghent University, Ghent, Belgium;School of Computer Science & Informatics, Cardiff University, Cardiff, UK;Dept. of Applied Math., CS & Stats, Ghent University, Ghent, Belgium;Computational Modeling Lab, Vrije Universiteit Brussel, Brussels, Belgium
Venue:
RuleML'13 Proceedings of the 7th international conference on Theory, Practice, and Applications of Rules on the Web
Year:
2013

Citing 11
Cited 0

Three fast algorithms for four problems in stable marriage

SIAM Journal on Computing
An efficient algorithm for the “optimal” stable marriage

Journal of the ACM (JACM)
Stable marriage and indifference

CO89 Selected papers of the conference on Combinatorial Optimization
Disjunctive datalog

ACM Transactions on Database Systems (TODS)
Hard variants of stable marriage

Theoretical Computer Science
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Tight logic programs

Theory and Practice of Logic Programming
The cycle roommates problem: a hard case of kidney exchange

Information Processing Letters
A Survey of the Stable Marriage Problem and Its Variants

ICKS '08 Proceedings of the International Conference on Informatics Education and Research for Knowledge-Circulating Society (icks 2008)
Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Answer set programming at a glance

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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.