International Workshop on Combinatorial Algorithms

IWOCA 2014: Combinatorial Algorithms pp 213-225 | Cite as

Profile-Based Optimal Matchings in the Student/Project Allocation Problem

  • Augustine KwanashieEmail author
  • Robert W.  Irving
  • David F. Manlove
  • Colin T. S. Sng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8986)


In the Student/Project Allocation problem (spa) we seek to assign students to individual or group projects offered by lecturers. Students provide a list of projects they find acceptable in order of preference. Each student can be assigned to at most one project and there are constraints on the maximum number of students that can be assigned to each project and lecturer. We seek matchings of students to projects that are optimal with respect to profile, which is a vector whose rth component indicates how many students have their rth-choice project. We present an efficient algorithm for finding agreedy maximum matching in the spa context – this is a maximum matching whose profile is lexicographically maximum. We then show how to adapt this algorithm to find a generous maximum matching – this is a matching whose reverse profile is lexicographically minimum. Our algorithms involve finding optimal flows in networks. We demonstrate how this approach can allow for additional constraints, such as lecturer lower quotas, to be handled flexibly.


Allocation Problem Edge Weight Generous Maximum Maximum Match Preference List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Abraham, D.J.: Algorithmics of two-sided matching problems. Master’s thesis, University of Glasgow, Department of Computing Science (2003)Google Scholar
  2. 2.
    Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the Student-Project allocation problem. J. Discrete Algorithms 5(1), 79–91 (2007)MathSciNetCrossRefGoogle Scholar
  3. 3.
    El-Atta, A.H.A., Moussa, M.I.: Student project allocation with preference lists over (student, project) pairs. In: Proceedings of ICCEE 09: The 2nd International Conference on Computer and Electrical Engineering, pp. 375–379 (2009)Google Scholar
  4. 4.
    Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)zbMATHGoogle Scholar
  5. 5.
    Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)zbMATHGoogle Scholar
  6. 6.
    Huang, C.-C., Kavitha, T., Mehlhorn, K., Michail, D.: Fair matchings and related problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), vol. 24, pp. 339–350 (2013)Google Scholar
  7. 7.
    Hylland, A., Zeckhauser, R.: The efficient allocation of individuals to positions. J. Polit. Econ. 87(2), 293–314 (1979)CrossRefGoogle Scholar
  8. 8.
    Irving, R.W.: Greedy matchings. Technical Report TR-2003-136, University of Glasgow, Department of Computing Science (2003)Google Scholar
  9. 9.
    Irving, R.W.: Greedy and generous matchings via a variant of the Bellman-Ford algorithm (2006) (Unpublished manuscript)Google Scholar
  10. 10.
    Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Trans. Algorithms 2(4), 602–610 (2006)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation bounds for the student-project allocation problem with preferences over projects. J. Discrete Algorithms 13, 59–66 (2012)zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Kwanashie, A., Irving, R.W., Manlove, D.F., Sng, C.T.S.: Profile-based optimal matchings in the Student/Project Allocation problem. CoRR Technical Report 1403.0751 (2014).
  13. 13.
    Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific, Singapore (2013)zbMATHCrossRefGoogle Scholar
  14. 14.
    Manlove, D.F., O’Malley, G.: Student project allocation with preferences over projects. J. Discrete Algorithms 6, 553–560 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    Mehlhorn, K., Michail, D.: Network problems with non-polynomial weights and applications (2006) (Unpublished manuscript)Google Scholar
  16. 16.
    Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41(2), 338–350 (1993)zbMATHMathSciNetCrossRefGoogle Scholar
  17. 17.
    Sng, C.T.S.: Efficient Algorithms for Bipartite Matching Problems with Preferences. Ph.D. thesis, University of Glasgow, Department of Computing Science (2008)Google Scholar
  18. 18.
    Zelvyte, M.: The Student-Project Allocation problem: a network flow model. Honours project dissertation, University of Glasgow, School of Mathematics and Statistics (2014)Google Scholar
  19. 19.
    Zhou, L.: On a conjecture by Gale about one-sided matching problems. J. Econ. Theor. 52(1), 123–135 (1990)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Augustine Kwanashie
    • 1
    Email author
  • Robert W.  Irving
    • 1
  • David F. Manlove
    • 1
  • Colin T. S. Sng
    • 2
  1. 1.School of Computing ScienceUniversity of GlasgowGlasgowUK
  2. 2.EBay Inc.AustinUSA

Personalised recommendations