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 FP NP -complete. Besides, a fair matching can be found in polynomial-time. Finally, deciding whether a stable (i.e. nonwasteful and fair) matching exists is NP NP -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

Fingerprint

Resource Allocation
Resource allocation
Students
Resources
NP-complete problem
Many to one
Indivisible
Polynomials
Matching Problem
Polynomial time
Symmetry
Computing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ismaili, A., Yamaguchi, T., & Yokoo, M. (2018). Student-project-resource allocation: Complexity of the symmetric case. In N. Oren, Y. Sakurai, I. Noda, T. Cao Son, T. Miller, & B. T. Savarimuthu (Eds.), PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, 2018, Proceedings (pp. 226-241). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11224 LNAI). Springer Verlag. https://doi.org/10.1007/978-3-030-03098-8_14

Student-project-resource allocation : Complexity of the symmetric case. / Ismaili, Anisse; Yamaguchi, Tomoaki; Yokoo, Makoto.

PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, 2018, Proceedings. ed. / Nir Oren; Yuko Sakurai; Itsuki Noda; Tran Cao Son; Tim Miller; Bastin Tony Savarimuthu. Springer Verlag, 2018. p. 226-241 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11224 LNAI).

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

Ismaili, A, Yamaguchi, T & Yokoo, M 2018, Student-project-resource allocation: Complexity of the symmetric case. in N Oren, Y Sakurai, I Noda, T Cao Son, T Miller & BT Savarimuthu (eds), PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11224 LNAI, Springer Verlag, pp. 226-241, 21st International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2018, Tokyo, Japan, 10/29/18. https://doi.org/10.1007/978-3-030-03098-8_14
Ismaili A, Yamaguchi T, Yokoo M. Student-project-resource allocation: Complexity of the symmetric case. In Oren N, Sakurai Y, Noda I, Cao Son T, Miller T, Savarimuthu BT, editors, PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, 2018, Proceedings. Springer Verlag. 2018. p. 226-241. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-03098-8_14
Ismaili, Anisse ; Yamaguchi, Tomoaki ; Yokoo, Makoto. / Student-project-resource allocation : Complexity of the symmetric case. PRIMA 2018: Principles and Practice of Multi-Agent Systems - 21st International Conference, 2018, Proceedings. editor / Nir Oren ; Yuko Sakurai ; Itsuki Noda ; Tran Cao Son ; Tim Miller ; Bastin Tony Savarimuthu. Springer Verlag, 2018. pp. 226-241 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{19b1e734dddc4fefafd640e221b1ca6e,
title = "Student-project-resource allocation: Complexity of the symmetric case",
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 FP NP -complete. Besides, a fair matching can be found in polynomial-time. Finally, deciding whether a stable (i.e. nonwasteful and fair) matching exists is NP NP -complete.",
author = "Anisse Ismaili and Tomoaki Yamaguchi and Makoto Yokoo",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-03098-8_14",
language = "English",
isbn = "9783030030971",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "226--241",
editor = "Nir Oren and Yuko Sakurai and Itsuki Noda and {Cao Son}, Tran and Tim Miller and Savarimuthu, {Bastin Tony}",
booktitle = "PRIMA 2018",
address = "Germany",

}

TY - GEN

T1 - Student-project-resource allocation

T2 - Complexity of the symmetric case

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 FP NP -complete. Besides, a fair matching can be found in polynomial-time. Finally, deciding whether a stable (i.e. nonwasteful and fair) matching exists is NP NP -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 FP NP -complete. Besides, a fair matching can be found in polynomial-time. Finally, deciding whether a stable (i.e. nonwasteful and fair) matching exists is NP NP -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

ER -