Based on duality theory of linear programming and graph theory, it is proved that the matching game defined on a bipartite graph has the stable core if and only if the graph has a perfect matching.