An Algorithm for Strong Stability in the Student-Project Allocation Problem With Ties

Olaosebikan, S. and Manlove, D. (2020) An Algorithm for Strong Stability in the Student-Project Allocation Problem With Ties. In: 6th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Sangareddy, India, 13-15 Feb 2020, pp. 384-399. ISBN 9783030392185 (doi:10.1007/978-3-030-39219-2_31)

[img]
Preview
Text
203082.pdf - Accepted Version

566kB

Abstract

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-st). We investigate the concept of strong stability in this context. Informally, a matching is strongly stable if there is no student and lecturer l such that if they decide to form a private arrangement outside of the matching via one of l’s proposed projects, then neither party would be worse off and at least one of them would strictly improve. We describe the first polynomial-time algorithm to find a strongly stable matching or report that no such matching exists, given an instance of spa-st. Our algorithm runs in O(m2) time, where m is the total length of the students’ preference lists.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
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
ISSN:0302-9743
ISBN:9783030392185
Copyright Holders:Copyright © 2020 Springer Nature Switzerland AG
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher
Related URLs:

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