1 citations · 1 across the 4 of their papers we have counts for
8 papers · 1 filter
Profile-based optimal stable matchings in the Roommates problem
Sofia Simola, David Manlove
The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard. We s…
Algorithms for new types of fair stable matchings
Frances Cooper, David Manlove
We study the problem of finding "fair" stable matchings in the Stable Marriage problem with Incomplete lists (SMI). For an instance of SMI there may be many stable matchings, p…
An Algorithm for Strong Stability in the Student-Project Allocation Problem with Ties
Sofiat Olaosebikan, David Manlove
We study a variant of the Student-Project Allocation problem with lecturer preferences over Students where ties are allowed in the preference lists of students and lecturers (SPA-S…
Two-sided profile-based optimality in the stable marriage problem
Frances Cooper, David Manlove
We study the problem of finding "fair" stable matchings in the Stable Marriage problem with Incomplete lists (SMI). In particular, we seek stable matchings that are optimal with re…
Mathematical models for stable matching problems with ties and incomplete lists
Maxence Delorme, Sergio García, Jacek Gondzio +3
We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its m…
Super-stability in the Student-Project Allocation Problem with Ties
Sofiat Olaosebikan, David Manlove
The Student-Project Allocation problem with lecturer preferences over Students (SPA-S) involves assigning students to projects based on student preferences over projects, lecturer…