We study one-sided matching problem, also known as roommate problem, where a group of people need to be paired in order to be assigned to certain location. We assume that number of rooms are limited and thus no student can live by himself. Each student has strict preferences over their...

This paper studies many-to-one matching markets, such as school choice. We propose an estimation approach that requires matching outcomes only but no submitted preferences information, to decompose students’ performance into peer quality, school effectiveness, and match effect, respectively....