In this talk, I consider a matching in a bipartite graph in which each vertex has a preference over the edges incident to it. Especially, I focus on a Pareto stable matching, which is a matching satisfying stability and Pareto efficiency. In talk, I give a survey of a Pareto stable matching including my recent result. I also talk about the relationship between Pareto stable matchings and combinatorial reconfiguration.