Super-Stability in the Student-Project Allocation Problem with Ties
The Student-Project Allocation problem with lecturer preferences over Students ( Open image in new window ) 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 preference lists are strictly ordered. Here, we study a generalisation of Open image in new window 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 ( Open image in new window ). 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 Open image in new window . 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 Open image in new window instances. Our main finding is that, whilst super-stable matchings can be elusive, the probability of such a matching existing is significantly higher if ties are restricted to the lecturers’ preference lists.
The authors would like to thank Frances Cooper and Kitty Meeks for valuable comments that helped to improve the presentation of this paper.
- 2.El-Atta, A.H.A., Moussa, M.I.: Student project allocation with preference lists over (student, project) pairs. In: Proceedings of ICCEE 2009: the 2nd International Conference on Computer and Electrical Engineering, pp. 375–379. IEEE (2009)Google Scholar
- 5.Chiarandini, M., Fagerberg, R., Gualandi, S.: Handling preferences in student-project allocation. Ann. Oper. Res. (2017). https://doi.org/10.1007/s10479-017-2710-1
- 6.Cooper, F., Manlove, D.F.: A 3/2-approximation algorithm for the student-project allocation problem. In: Proceedings of SEA 2018. LIPIcs, vol. 103 pp. 8:1–8:13 (2018)Google Scholar
- 13.Kazakov, D.: Co-ordination of student-project allocation. Manuscript, University of York, Department of Computer Science (2001). http://www-users.cs.york.ac.uk/kazakov/papers/proj.pdf. Accessed 8 Mar 2018
- 14.Kwanashie, A., Irving, R.W., Manlove, D.F., Sng, C.T.S.: Profile-based optimal matchings in the student/project allocation problem. In: Kratochvíl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 213–225. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19315-1_19CrossRefGoogle Scholar
- 17.Manlove, D., Milne, D., Olaosebikan, S.: An integer programming approach to the student-project allocation problem with preferences over projects. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) ISCO 2018. LNCS, vol. 10856, pp. 313–325. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96151-4_27CrossRefGoogle Scholar
- 19.Olaosebikan, S., Manlove, D.F.: Super-stability in the student-project allocation problem with ties. http://arxiv.org/abs/1805.09887