Preference profiles determining the proposals in the Gale–Shapley algorithm for stable matching problems
- 161 Downloads
Concerning the strategic manipulability of the stable matching produced by the Gale–Shapley algorithm, Kobayashi and Matsui recently considered the existence problem of a preference profile of women, that is, given a preference profile of men, find a preference profile of women that makes the Gale–Shapley algorithm produce the prescribed complete matching of men and women. Reformulating this problem by introducing the set of proposals to be made through the execution of the algorithm, and switching the roles of men and women, we consider the existence problem of a preference profile of men and show that the problem is reduced to a problem of checking if a directed graph is a rooted tree and it is solvable in polynomial time. We also show that the existence problem of preference profiles of both sexes when a set of proposals is given is solvable in polynomial time.
KeywordsStable matching Gale–Shapley algorithm Preference profile Strategic manipulability Rooted spanning tree Matroid intersection
Mathematics Subject Classification90C27 91A40 91B08 91B68
Unable to display preview. Download preview PDF.
- 6.Knuth, D.E.: Mariages stables et leurs relations avec d’autres problèmes combinatoires, Les Presses de l’Universitè de Montrèal (1976). English translation Goldstein, M.: Stable marriage and its relation to other combinatorial problems. In: CRM Proceedings and Lecture Notes, vol. 10. American Mathematical Society, Providence (1997)Google Scholar
- 9.Lawler E.L.: Combinatorial Optimization: Network and Matroids, Holt. Rinehart and Winston, New York (1976)Google Scholar