Skip to main content

Using Preferences to Solve Student–Class Allocation Problem

  • Conference paper
Intelligent Data Engineering and Automated Learning - IDEAL 2009 (IDEAL 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5788))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, London (1993)

    Google Scholar 

  2. Chevaleyre, Y., Dunne, P.E., Endriss, U., Lang, J., Lemaître, M., Maudet, N., Padget, J., Phelps, S., Rodríguez-Aguilar, J.A., Sousa, P.: Issues in Multiagent Resource Allocation (2005)

    Google Scholar 

  3. Winstanley, G.: Resource Allocation in Model-Based Planning Systems. In: Proceedings of the IEE Colloquium entitled ”Resource Scheduling for Large-Scale Planning Systems”, Digest Number 1993/144 (1993)

    Google Scholar 

  4. Dasgupta, P., Hoeing, M.: Task Selection in Multi-Agent Swarms using Adaptive Bid Auctions. In: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems, July 2007, pp. 307–310. IEEE Computer Society, Los Alamitos (2007)

    Chapter  Google Scholar 

  5. Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. Cambridge University Press, Cambridge (2009)

    MATH  Google Scholar 

  6. Smith, R.G.: The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver. IEEE Transactions on Computers (1980)

    Google Scholar 

  7. Aumann, R., Hart, S.: Handbook of Game Theory with economics applications, vol. 2. Elsevier, Amsterdam (1994)

    MATH  Google Scholar 

  8. Luke, S., Cioffi-Revilla, C., Panait, L., Sullivan, K.: MASON: A New Multi-Agent Simulation Toolkit. In: Proceedings of the 2004 SwarmFest Workshop (2004)

    Google Scholar 

  9. Railsback, S.F., Lytinen, S.L., Jackson, S.K.: Agent-based simulation platforms: review and development recommendations. Simulation 82(9), 609–623 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cano, J.I., Sánchez, L., Camacho, D., Pulido, E., Anguiano, E. (2009). Using Preferences to Solve Student–Class Allocation Problem. In: Corchado, E., Yin, H. (eds) Intelligent Data Engineering and Automated Learning - IDEAL 2009. IDEAL 2009. Lecture Notes in Computer Science, vol 5788. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04394-9_76

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04394-9_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04393-2

  • Online ISBN: 978-3-642-04394-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics