publication . Preprint . Part of book or chapter of book . Article . Conference object . Other literature type . 2018

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

Olaosebikan, Sofiat; Manlove, David;
Open Access English
  • Published: 01 Jan 2018
  • Country: United Kingdom
Abstract
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 m...
Subjects
ACM Computing Classification System: ComputingMilieux_COMPUTERSANDEDUCATION
free text keywords: Computer Science - Data Structures and Algorithms, Computational Theory and Mathematics, Control and Optimization, Applied Mathematics, Discrete Mathematics and Combinatorics, Computer Science Applications
Funded by
RCUK| IP-MATCH: Integer Programming for Large and Complex Matching Problems
Project
  • Funder: Research Council UK (RCUK)
  • Project Code: EP/P028306/1
  • Funding stream: EPSRC
Download fromView all 6 versions
http://eprints.gla.ac.uk/16954...
Part of book or chapter of book
Provider: UnpayWall
Enlighten
Conference object . 2018
http://dx.doi.org/10.1007/978-...
Other literature type . 2018
Provider: Datacite
21 references, page 1 of 2

1. D.J. Abraham, R.W. Irving, and D.F. Manlove. Two algorithms for the StudentProject allocation problem. Journal of Discrete Algorithms, 5(1):79-91, 2007.

2. A.H. Abu El-Atta and M.I. Moussa. Student project allocation with preference lists over (student,project) pairs. In Proceedings of ICCEE 09: the 2nd International Conference on Computer and Electrical Engineering, pages 375-379. IEEE, 2009.

3. A.A. Anwar and A.S. Bahaj. Student project allocation using integer programming. IEEE Transactions on Education, 46(3):359-367, 2003. [OpenAIRE]

4. G. Brassard and P. Bratley. Fundamentals of Algorithmics. Prentice-Hall, 1996.

5. R. Calvo-Serrano, G. Guill´en-Gos´albez, S. Kohn, and A. Masters. Mathematical programming approach for optimally allocating students' projects to academics in large cohorts. Education for Chemical Engineers, 20:11-21, 2017.

6. M. Chiarandini, R. Fagerberg, and S. Gualandi. Handling preferences in studentproject allocation. Annals of Operations Research, to appear, 2018.

7. F. Cooper and D.F. Manlove. A 3/2-approximation algorithm for the StudentProject Allocation problem. CoRR, abs/1804.02731, 2018. Available from http: //arxiv.org/abs/1804.02731. [OpenAIRE]

8. P.R. Harper, V. de Senna, I.T. Vieira, and A.K. Shahani. A genetic algorithm for the project assignment problem. Computers and Operations Research, 32:1255- 1265, 2005. [OpenAIRE]

9. R.W. Irving. Stable marriage and indifference. Discrete Applied Mathematics, 48:261-272, 1994.

10. R.W. Irving, D.F. Manlove, and S. Scott. The Hospitals/Residents problem with Ties. In Proceedings of SWAT '00: the 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 259-271. Springer, 2000.

11. R.W. Irving, D.F. Manlove, and S. Scott. Strong stability in the Hospitals/Residents problem. In Proceedings of STACS '03: the 20th Annual Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 439-450. Springer, 2003.

12. K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita. Stable marriage with incomplete lists and ties. In Proceedings of ICALP '99: the 26th International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 443-452. Springer, 1999. [OpenAIRE]

13. K. Iwama, S. Miyazaki, and H. Yanagisawa. Improved approximation bounds for the student-project allocation problem with preferences over projects. Journal of Discrete Algorithms, 13:59-66, 2012.

14. D. Kazakov. Co-ordination of student-project allocation. Manuscript, University of York, Department of Computer Science. Available from http://www-users.cs. york.ac.uk/kazakov/papers/proj.pdf (last accessed 8 March 2018), 2001.

15. A. Kwanashie, R.W. Irving, D.F. Manlove, and C.T.S. Sng. Profile-based optimal matchings in the Student-Project Allocation problem. In Proceedings of IWOCA '14: the 25th International Workshop on Combinatorial Algorithms, volume 8986 of Lecture Notes in Computer Science, pages 213-225. Springer, 2015.

21 references, page 1 of 2
Abstract
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 m...
Subjects
ACM Computing Classification System: ComputingMilieux_COMPUTERSANDEDUCATION
free text keywords: Computer Science - Data Structures and Algorithms, Computational Theory and Mathematics, Control and Optimization, Applied Mathematics, Discrete Mathematics and Combinatorics, Computer Science Applications
Funded by
RCUK| IP-MATCH: Integer Programming for Large and Complex Matching Problems
Project
  • Funder: Research Council UK (RCUK)
  • Project Code: EP/P028306/1
  • Funding stream: EPSRC
Download fromView all 6 versions
http://eprints.gla.ac.uk/16954...
Part of book or chapter of book
Provider: UnpayWall
Enlighten
Conference object . 2018
http://dx.doi.org/10.1007/978-...
Other literature type . 2018
Provider: Datacite
21 references, page 1 of 2

1. D.J. Abraham, R.W. Irving, and D.F. Manlove. Two algorithms for the StudentProject allocation problem. Journal of Discrete Algorithms, 5(1):79-91, 2007.

2. A.H. Abu El-Atta and M.I. Moussa. Student project allocation with preference lists over (student,project) pairs. In Proceedings of ICCEE 09: the 2nd International Conference on Computer and Electrical Engineering, pages 375-379. IEEE, 2009.

3. A.A. Anwar and A.S. Bahaj. Student project allocation using integer programming. IEEE Transactions on Education, 46(3):359-367, 2003. [OpenAIRE]

4. G. Brassard and P. Bratley. Fundamentals of Algorithmics. Prentice-Hall, 1996.

5. R. Calvo-Serrano, G. Guill´en-Gos´albez, S. Kohn, and A. Masters. Mathematical programming approach for optimally allocating students' projects to academics in large cohorts. Education for Chemical Engineers, 20:11-21, 2017.

6. M. Chiarandini, R. Fagerberg, and S. Gualandi. Handling preferences in studentproject allocation. Annals of Operations Research, to appear, 2018.

7. F. Cooper and D.F. Manlove. A 3/2-approximation algorithm for the StudentProject Allocation problem. CoRR, abs/1804.02731, 2018. Available from http: //arxiv.org/abs/1804.02731. [OpenAIRE]

8. P.R. Harper, V. de Senna, I.T. Vieira, and A.K. Shahani. A genetic algorithm for the project assignment problem. Computers and Operations Research, 32:1255- 1265, 2005. [OpenAIRE]

9. R.W. Irving. Stable marriage and indifference. Discrete Applied Mathematics, 48:261-272, 1994.

10. R.W. Irving, D.F. Manlove, and S. Scott. The Hospitals/Residents problem with Ties. In Proceedings of SWAT '00: the 7th Scandinavian Workshop on Algorithm Theory, volume 1851 of Lecture Notes in Computer Science, pages 259-271. Springer, 2000.

11. R.W. Irving, D.F. Manlove, and S. Scott. Strong stability in the Hospitals/Residents problem. In Proceedings of STACS '03: the 20th Annual Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 439-450. Springer, 2003.

12. K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita. Stable marriage with incomplete lists and ties. In Proceedings of ICALP '99: the 26th International Colloquium on Automata, Languages, and Programming, volume 1644 of Lecture Notes in Computer Science, pages 443-452. Springer, 1999. [OpenAIRE]

13. K. Iwama, S. Miyazaki, and H. Yanagisawa. Improved approximation bounds for the student-project allocation problem with preferences over projects. Journal of Discrete Algorithms, 13:59-66, 2012.

14. D. Kazakov. Co-ordination of student-project allocation. Manuscript, University of York, Department of Computer Science. Available from http://www-users.cs. york.ac.uk/kazakov/papers/proj.pdf (last accessed 8 March 2018), 2001.

15. A. Kwanashie, R.W. Irving, D.F. Manlove, and C.T.S. Sng. Profile-based optimal matchings in the Student-Project Allocation problem. In Proceedings of IWOCA '14: the 25th International Workshop on Combinatorial Algorithms, volume 8986 of Lecture Notes in Computer Science, pages 213-225. Springer, 2015.

21 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue