Manipulation and gender neutrality in stable marriage procedures

Preprint English OPEN
Pini, Maria; Rossi, Francesca; Venable, Brent; Walsh, Toby;
(2009)
  • Subject: Computer Science - Artificial Intelligence | Computer Science - Computer Science and Game Theory | I.2.4

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 hospital... View more
  • References (25)
    25 references, page 1 of 3

    [1] K.J. Arrow, A.K. Sen and K. Suzumura. Handbook of Social Choice and Welfare. North Holland, Elsevier, 2002

    [2] J. Bartholdi and J. Orlin. Single transferable vote resists strategic voting. In Social Choice and Welfare, 8(4):341-354, 1991.

    [3] J.J. Bartholdi, C. A. Tovey and M. A. Trick, The computational difficulty of manipulating an election. In Social Choice and Welfare 6(3):227-241, 1989.

    [4] V. Conitzer and T. Sandholm. Nonexistence of voting rules that are usually hard to manipulate. InProc. AAAI'06, 2006.

    [5] V. Conitzer and T. Sandholm. Universal Voting Protocol Tweaks to Make Manipulation Hard. In Proc. IJCAI'03: 781-788, 2003.

    [6] G. Demange, D. Gale, and M. Sotomayor. A further note on the stable matching problem. In Discrete Applied Mathematics, 16:217-222, 1987.

    [7] L. Dubins and D. Freedman. Machiavelli and the Gale-Shapley algorithm. In American Mathematical Monthly, 88:485-494, 1981.

    [8] D. Gale, L. S. Shapley. College Admissions and the Stability of Marriage. In Amer. Math. Monthly, 69:9-14, 1962.

    [9] D. Gale and M. Sotomayor. Some remarks on the stable matching prob- lem. Discrete Applied Mathematics, 11:223-232, 1985.

    [10] D. Gale and M. Sotomayor. Machiavelli and the stable matching problem. American Mathematical Monthly, 92:261-268, 1985.

  • Metrics
Share - Bookmark