Simple mechanisms to implement the core of college admissions problems

Abstract

This paper provides three simple mechanisms to implement allocations in the core of matching markets. We analyze some sequential mechanisms which mimic matching procedures for many-to-one real life matching markets. We show that only core allocations should be attained when agents act strategically faced with these mechanisms. Two mechanisms implement the core correspondence in SPE, whereas the third implements the students' optimal stable solution.College admissions problems, mechanism design