Solving stable matching problems using answer set programming

De Clercq, Sofie, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881, De Cock, Martine and Nowe, Ann 2016. Solving stable matching problems using answer set programming. Theory and Practice of Logic Programming 16 (3) , pp. 247-268. 10.1017/S147106841600003X

Full text not available from this repository.

Abstract

Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for finding the stable matchings. To address this issue, we propose an encoding of the SMP using answer set programming (ASP), which can straightforwardly be adapted and extended to suit the needs of specific applications. The use of ASP also means that we can take advantage of highly efficient off-the-shelf solvers. To illustrate the flexibility of our approach, we show how our ASP encoding naturally allows us to select optimal stable matchings, i.e. matchings that are optimal according to some user-specified criterion. To the best of our knowledge, our encoding offers the first exact implementation to find sex-equal, minimum regret, egalitarian or maximum cardinality stable matchings for SMP instances in which individuals may designate unacceptable partners and ties between preferences are allowed.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Cambridge University Press
ISSN:	1475-3081
Date of Acceptance:	14 December 2015
Last Modified:	02 Nov 2022 09:57
URI:	https://orca.cardiff.ac.uk/id/eprint/96953

Citation Data

Cited 3 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item