Super-stability in the student-project allocation problem with ties

Olaosebikan, S. and Manlove, D. (2020) Super-stability in the student-project allocation problem with ties. Journal of Combinatorial Optimization, (doi: 10.1007/s10878-020-00632-x) (Early Online Publication)

221622.pdf - Published Version
Available under License Creative Commons Attribution.



The Student-Project Allocation problem with lecturer preferences over Students (spa- s) involves assigning students to projects based on student preferences over projects, lecturer preferences over students, and the maximum number of students that each project and lecturer can accommodate. This classical model assumes that each project is offered by one lecturer and that preference lists are strictly ordered. Here, we study a generalisation of spa-s where ties are allowed in the preference lists of students and lecturers, which we refer to as the Student-Project Allocation problem with lecturer preferences over Students with Ties (spa-st). We investigate stable matchings under the most robust definition of stability in this context, namely super- stability. We describe the first polynomial-time algorithm to find a super-stable matching or to report that no such matching exists, given an instance of spa-st. Our algorithm runs in O(L) time, where L is the total length of all the preference lists. Finally, we present results obtained from an empirical evaluation of the linear-time algorithm based on randomly-generated spa-st instances. Our main finding is that, whilst super-stable matchings can be elusive when ties are present in the students’ and lecturers’ preference lists, the probability of such a matching existing is significantly higher if ties are restricted to the lecturers’ preference lists.

Item Type:Articles
Status:Early Online Publication
Glasgow Author(s) Enlighten ID:Manlove, Professor David and Olaosebikan, Dr Sofiat
Authors: Olaosebikan, S., and Manlove, D.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Journal of Combinatorial Optimization
ISSN (Online):1573-2886
Published Online:12 August 2020
Copyright Holders:Copyright © 2020 The Authors
First Published:First published in Journal of Combinatorial Optimization 2020
Publisher Policy:Reproduced under a Creative Commons License

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
300808IP-MATCH: Integer Programming for Large and Complex Matching ProblemsDavid ManloveEngineering and Physical Sciences Research Council (EPSRC)EP/P028306/1Computing Science