Manipulation complexity and gender neutrality in stable marriage procedures
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a wide variety of practical applications, ranging from matching resident doctors, to hospitals to matching students to schools. A well-known algorithm to solve this problem is the Gale–Shapley algorithm, which runs in quadratic time in the number of men/women. It has been proven that stable marriage procedures can always be manipulated. Whilst the Gale–Shapley algorithm is computationally easy to manipulate, we prove that there exist stable marriage procedures which are NP-hard to manipulate. We also consider the relationship between voting theory and stable marriage procedures, showing that voting rules which are NP-hard to manipulate can be used to define stable marriage procedures which are themselves NP-hard to manipulate. Finally, we consider the issue that stable marriage procedures like Gale–Shapley favour one gender over the other, and we show how to use voting rules to make any stable marriage procedure gender neutral.
KeywordsComputational social choice Stable marriage problems Manipulation Voting theory
Unable to display preview. Download preview PDF.
- 1.Arrow K. J., Sen A. K., Suzumura K. (2002) Handbook of social choice and welfare. Elsevier, North HollandGoogle Scholar
- 4.Conitzer, V., & Sandholm, T. (2003). Universal voting protocol tweaks to make manipulation hard. In Proceedings of the IJCAI’03, pp. 781–788.Google Scholar
- 5.Conitzer, V., & Sandholm, T. (2006). Nonexistence of voting rules that are usually hard to manipulate. In Proceedings of the AAAI’06, AAAI Press.Google Scholar
- 13.Gusfield, D. (1987). Three fast algorithms for four problems in stable marriage. SIAM Journal of Computing, 16(1).Google Scholar
- 14.Huang, C.-C. (2006). Cheating by men in the Gale–Shapley stable matching algorithm. In Proceedings of the ESA’06, pp. 418-431, Springer-Verlag.Google Scholar
- 17.Knuth, D. E. (1976). Mariages stables et leurs relations avec d’autres problèmes combinatoires. (French) Introduction à l’analyse mathématique des algorithmes. Collection de la Chaire Aisenstadt. Les Presses de l’Université de Montréal, Montreal, Que.Google Scholar
- 18.Kobayashi, H., & Matsui, T. (2008). Successful manipulation in stable marriage model with complete preference lists. In Proceedings of the MATCH-UP workshop: A satellite workshop of ICALP’08, pp. 17–22.Google Scholar
- 24.Roth A. (2008) Deferred acceptance algorithms: History, theory, practice, and open questions. International Journal of Game Theory, Special Issue in Honor of David Gale on his 85th birthday 85: 537–569Google Scholar
- 29.Walsh, T. (2009). Where are the really hard manipulation problems? The phase transition in manipulating the veto rule. In Proceedings of the IJCAI’09, pp. 324–329.Google Scholar
- 30.Xia, L., Conitzer, V. (2008). Generalized scoring rules and the frequency of coalitional manipulability. In Proceeding of the ACM conference on electronic commerce 2008, pp. 109-118, ACM Press.Google Scholar