Popularity in the Generalized Hospital Residents Setting

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10304)

Abstract

We consider the problem of computing popular matchings in a bipartite graph \(G = (\mathcal {R}\,\cup \, \mathcal {H}, E)\) where \(\mathcal {R}\) and \(\mathcal {H}\) denote a set of residents and a set of hospitals respectively. Each hospital h has a positive capacity denoting the number of residents that can be matched to h. The residents and the hospitals specify strict preferences over each other. This is the well-studied Hospital Residents (HR) problem which is a generalization of the Stable Marriage (SM) problem. The goal is to assign residents to hospitals optimally while respecting the capacities of the hospitals. Stability is a well-accepted notion of optimality in such problems. However, motivated by the need for larger cardinality matchings, alternative notions of optimality like popularity have been investigated in the SM setting. In this paper, we consider a generalized HR setting – namely the Laminar Classified Stable Matchings (LCSM\(^+\)) problem. Here, additionally, hospitals can specify classifications over residents in their preference lists and classes have upper quotas. We show the following new results: We define a notion of popularity and give a structural characterization of popular matchings for the LCSM\(^+\) problem. Assume \(n = |\mathcal {R}| + |\mathcal {H}|\) and \(m = |E|\). We give an O(mn) time algorithm for computing a maximum cardinality popular matching in an LCSM\(^+\) instance. We give an \(O(mn^2)\) time algorithm for computing a matching that is popular amongst the maximum cardinality matchings in an LCSM\(^+\) instance.

Notes

Acknowledgement

We thank Prajakta Nimbhorkar for helpful discussions. We thank the anonymous reviewers whose comments have improved the presentation.

References

  1. 1.
    Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37(4), 1030–1045 (2007)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the student-project allocation problem. J. Discrete Algorithms 5(1), 73–90 (2007)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Biró, P., Manlove, D., Mittal, S.: Size versus stability in the marriage problem. Theoret. Comput. Sci. 411(16–18), 1828–1841 (2010)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Brandl, F., Kavitha, T.: Popular Matchings with Multiple Partners. CoRR, abs/1609.07531 (2016)Google Scholar
  5. 5.
    Cseh, Á., Kavitha, T.: Popular edges and dominant matchings. In: Proceedings of the Eighteenth Conference on Integer Programming and Combinatorial Optimization, pp. 138–151 (2016)Google Scholar
  6. 6.
    Fleiner, T., Kamiyama, N.: A matroid approach to stable matchings with lower quotas. In: Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 135–142 (2012)Google Scholar
  7. 7.
    Gale, D., Shapley, L.: College admissions and the stability of marriage. Am. Math. Monthly 69, 9–14 (1962)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Gärdenfors, P.: Match making: assignments based on bilateral preferences. Behav. Sci. 20, 166–173 (1975)CrossRefGoogle Scholar
  9. 9.
    Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)MATHGoogle Scholar
  10. 10.
    Huang, C.-C.: Classified stable matching. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1235–1253 (2010)Google Scholar
  11. 11.
    Huang, C.-C., Kavitha, T.: Popular matchings in the stable marriage problem. In: Proceedings of 38th International Colloquium on Automata, Languages and Programming, pp. 666–677 (2011)Google Scholar
  12. 12.
    Kamiyama, N.: Popular matchings with two-sided preference lists and matroid constraints. Technical report MI 2016–13 (2016)Google Scholar
  13. 13.
    Kavitha, T.: A size-popularity tradeoff in the stable marriage problem. SIAM J. Comput. 43(1), 52–71 (2014)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Nasre, M., Rawat, A.: Popularity in the Generalized Hospital Residents Setting. CoRR, abs/1609.07650 (2016)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Indian Institute of Technology MadrasChennaiIndia

Personalised recommendations