Student-Project Allocation with preferences over Projects
نویسندگان
چکیده
منابع مشابه
Student-Project Allocation with Preferences over Projects
We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this context we seek a stable matching of students to projects, which respects these preference and capacity constraints. Here, the stability definition generalises the corresponding notion in the context of the classical ...
متن کاملThe Student-Project Allocation Problem
We study the Student-Project Allocation problem (SPA), a generalisation of the classical Hospitals / Residents problem (HR). An instance of SPA involves a set of students, projects and lecturers. Each project is offered by a unique lecturer, and both projects and lecturers have capacity constraints. Students have preferences over projects, whilst lecturers have preferences over students. We pre...
متن کاملProject Management in Student Information Technology Projects
Universities teach project management to information technology (IT) students. The project management principles that students previously have learned often are put into practice in a project course that is intended to give final-year students the experience of applying their knowledge to real or simulated projects. This article reports on research that investigated the use and usefulness of pr...
متن کاملStudent project allocation using integer programming
The allocation of projects to students is a generic problem in many universities within the U.K. and elsewhere, not only in engineering but also in various other disciplines. This paper defines the student project allocation problem explicitly by an objective function and a number of constraints. Two integer program models are presented, the first of which is a dynamic program. A general purpos...
متن کاملUsing Preferences to Solve Student-Class Allocation Problem
Resource allocation is a form of Constraint Satisfaction Problem (CSP) in which a set of resources must be assigned to a set of agents. Multiagent Resource Allocation (MARA) makes possible solving CSP using qualitative parameters as, for example, reduce idle time in scheduling or preferences over the set of resources to be allocated. In this paper, we are going to use a MARA approach to find a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2008
ISSN: 1570-8667
DOI: 10.1016/j.jda.2008.07.003