Rank-maximal matchings

Abstract

Suppose that each member of a set A of applicants ranks a subset of a set P of posts in an order of preference, possibly involving ties. A matching is a set of (applicant, post) pairs such that each applicant and each post appears in at most one pair. A rank-maximal matching is one in which the maximum possible number of applicants are matched to their first choice post, and subject to that condition, the maximum possible number are matched to their second choice post, and so on. This is a relevant concept in any practical matching situation and it was first studied by Irving [2003].We give an algorithm to compute a rank-maximal matching with running time O(min(n + C,C √n)m), where C is the maximal rank of an edge used in a rank-maximal matching, n is the number of applicants and posts and m is the total size of the preference lists.

References

1. Gabow, H. N., and Tarjan, R. E. 1989. Faster scaling algorithms for network problems. SIAM J. Comput., 18, 1013--1036.]]
2. Gale, D., and Shapley, L. S. 1962. College admissions and the stability of marriage. Amer. Math. Monthly, 69, 9--15.]]
3. Gusfield, D., and Irving, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA.]]
4. Halldórsson, M. M., Iwama, K., Miyasaki, S., and Yanagisawa, H. 2003. Improved approximation of the stable marriage problem. In Proceedings of the 11th European Symposium on Algorithms 2003, Lecture Notes in Computer Science, vol. 2832, Springer-Verlag, New York, 266--277.]]
5. Hopcroft, J. E., and Karp, R. M. 1973. An n5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2, 225--231.]]
6. Irving, R. W. 1998. Matching medical students to pairs of hospitals: A new variation on a well-known theme. In Proceedings of the 6th European Symposium on Algorithms 1998. Lecture Notes in Computer Science, vol. 1461. Springer-Verlag, New York, 381--392.]]
7. Irving, R. W. 2003. Greedy matchings. Tech. Rep. TR-2003-136. University of Glasgow, Glasgow, UK, Apr.]]
8. Irving, R. W., Manlove, D. F., and Scott, S. 2003. Strong stability in the hospitals-residents problem. In Proceedings of the 20th Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 2607. Springer-Verlag, New York. 439--450.]]
9. Mehlhorn, K., and Michail, D. Network problems with non-polynomial weights and applications. www.mpi-sb.mpg.de/~mehlhorn/ftp/HugeWeights.ps]]
10. Pulleyblank, W. R. 1995. Matchings and extensions, In The Handbook of Combinatorics, R. L., Graham, M., Grötschel, and L., Lovász, Eds. North Holland, Amsterdan, The Netherland, 179--232.]]
11. Roth, A. E. 1984. The evaluation of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92, 6, 991--1016.]]

Index Terms

• Mathematics of computing

  • Discrete mathematics

    • Graph theory

      • Graph algorithms