1 research outputs found
The Complexity of Student-Project-Resource Matching-Allocation Problems
I settle the computational complexity of student-project-resource
matching-allocation problems, in which students and resources are assigned to
projects \citep{pc2017}. A project's capacity for students is endogenously
determined by the resources allocated to it. I show that finding a nonwasteful
matching is -hard, and deciding a stable
matching is -complete. To obtain these results, I
introduce two new problems: (i) \textsc{ParetoPartition}, shown
-hard and also strongly
-hard, and (ii)
\textsc{-4-Partition}, shown strongly
-complete.Comment: technical repor