TY - GEN

T1 - Student-project-resource allocation

T2 - 21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018

AU - Ismaili, Anisse

AU - Yamaguchi, Tomoaki

AU - Yokoo, Makoto

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85056486332&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056486332&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-03098-8_14

DO - 10.1007/978-3-030-03098-8_14

M3 - Conference contribution

AN - SCOPUS:85056486332

SN - 9783030030971

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 226

EP - 241

BT - PRIMA 2018

A2 - Oren, Nir

A2 - Sakurai, Yuko

A2 - Noda, Itsuki

A2 - Cao Son, Tran

A2 - Miller, Tim

A2 - Savarimuthu, Bastin Tony

PB - Springer Verlag

Y2 - 29 October 2018 through 2 November 2018

ER -