This paper provides three simple mechanisms to implement allocations in the core of matching markets. \Ve analyze sorne sequential rnechanisms which mimic matching procedures for many-to-one reallife matching markets. \Ve show that only cor,e allocations should be attained when agents act strategically faced váth these mechanisms. Two mechanisms implement the core correspondence in SPE, whereas the third implements the students· optimal stable solution