Student-project-resource allocation: Complexity of the symmetric case

Anisse Ismaili, Tomoaki Yamaguchi, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we consider a student-project-resource allocation problem, in which students and indivisible resources are allocated to every project. The allocated resources determine endogenously the student capacity of a project. Traditionally, this problem is divided in two: (I) resources are allocated to projects based on expected demands (resource allocation problem), and (II) students are matched with projects based on the capacity determined in the previous problem (many-to-one matching problem). Although both problems are well-understood, unless the expectations used in the first problem are correct, we obtain a suboptimal outcome. Thus, it is desirable to solve this problem as a whole, without dividing it. We start by introducing a compact representation that takes advantage of the symmetry of preferences. Then, we show that computing a nonwasteful matching is FPNP -complete. Besides, a fair matching can be found in polynomial-time. Finally, deciding whether a stable (i.e. nonwasteful and fair) matching exists is NPNP -complete.

Original languageEnglish
Title of host publicationPRIMA 2018
Subtitle of host publicationPrinciples and Practice of Multi-Agent Systems - 21st International Conference, 2018, Proceedings
EditorsNir Oren, Yuko Sakurai, Itsuki Noda, Tran Cao Son, Tim Miller, Bastin Tony Savarimuthu
PublisherSpringer Verlag
Pages226-241
Number of pages16
ISBN (Print)9783030030971
DOIs
Publication statusPublished - Jan 1 2018
Event21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018 - Tokyo, Japan
Duration: Oct 29 2018Nov 2 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11224 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018
CountryJapan
CityTokyo
Period10/29/1811/2/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Student-project-resource allocation: Complexity of the symmetric case'. Together they form a unique fingerprint.

Cite this