Mathematical models for stable matching problems with ties and incomplete lists

Abstract

We present new integer linear programming (ILP) models for N P-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its many-to-one generalisation, the Hospitals / Residents problem with Ties (HRT). These models can be used to efficiently solve these optimisation problems when applied to (i) instances derived from real-world applications, and (ii) larger instances that are randomlygenerated. In the case of SMTI, we consider instances arising from the pairing of children with adoptive families, where preferences are obtained from a quality measure of each possible pairing of child to family. In this case we seek a maximum weight stable matching. We present new algorithms for preprocessing instances of SMTI with ties on both sides, as well as new ILP models. Algorithms based on existing state-of-the-art models only solve 6 of our 22 real-world instances within an hour per instance, and our new models incorporating dummy variables and constraint merging, together with preprocessing and a warm start, solve all 22 instances within a mean runtime of a minute. For HRT, we consider instances derived from the problem of assigning junior doctors to foundation posts in Scottish hospitals. Here we seek a maximum size stable matching. We show how to extend our models for SMTI to HRT and reduce the average running time for real-world HRT instances by two orders of magnitude. We also show that our models outperform by a wide margin all known state-of-the-art models on larger randomly-generated instances of SMTI and HRT.

Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange

“…In particular, for Gale and Shapley's [20] college admissions model, Baïou and Balinski [5] already described the stable admissions polytope, which can be used as a basic IP formulation. Further recent papers in this line of research focused on college admissions with special features [3], stable project allocation under distributional constraints [4], the hospital-resident problem with couples [9], and ties [30,17].…”

Online voluntary mentoring: Optimising the assignment of students and mentors

“…However, there can be some special features that can make the stable matching problem computationally hard to solve. In this case one robust approach to tackle these problems is (mixed) integer linear programming, that has been used recently for the hospital-resident problem with couples [11], ties [22,17], college admissions with lower and common quotas [4], and stable project allocation under distributional constraints [5]. In this paper we also use MILP technique for solving the underlying optimisation problem.…”

Cutoff stability under distributional constraints with an application to summer internship matching

“…Let z a,p be the score of applicant a at project p, a given constant integer in the interval [0,|A|]. For every project p, let d(p) be an integer variable in the range of [0,|A| + 1] denoting the cutoff of project p. We can link the cutoff scores with the induced matching M by the following set of constraints, as also used in Ágoston et al [2016] and Delorme et al [2019]. d(p) ≤ (1−y a,p )(|A|+1)+z a,p for each (a,p) (4) The above constraint enforces that if an applicant is assigned to a project then she reached the cutoff there.…”