Using preferences to solve student-class allocation problem

  • Authors:

  • Juan I. Cano;Luis Sánchez;David Camacho;Estrella Pulido;Eloy Anguiano

  • Affiliations:

  • Computer Science Department, Universidad Autónoma de Madrid, Madrid, Spain and Centro de Referencia Linux, Universidad Autónoma de Madrid, IBM, Madrid, Spain;Centro de Referencia Linux, Universidad Autónoma de Madrid, IBM, Madrid, Spain;Computer Science Department, Universidad Autónoma de Madrid, Madrid, Spain;Computer Science Department, Universidad Autónoma de Madrid, Madrid, Spain;Computer Science Department, Universidad Autónoma de Madrid, Madrid, Spain and Centro de Referencia Linux, Universidad Autónoma de Madrid, IBM, Madrid, Spain

  • Venue:
  • IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 solution to the student-class allocation problem, where each class has a number of seats, each student has his preferences over the schedule and the institution requests a uniform distribution of the students in classes and some other rules.