pp 1–24 | Cite as

Envy-Free Matchings with Lower Quotas

  • Yu YokoiEmail author
Part of the following topical collections:
  1. Special Issue: Algorithms and Computation


While every instance of the Hospitals/Residents problem admits a stable matching, the problem with lower quotas (HR-LQ) has instances with no stable matching. For such an instance, we expect the existence of an envy-free matching, which is a relaxation of a stable matching preserving a kind of fairness property. In this paper, we investigate the existence of an envy-free matching in several settings, in which hospitals have lower quotas and not all doctor–hospital pairs are acceptable. We first provide an algorithm that decides whether a given HR-LQ instance has an envy-free matching or not. Then, we consider envy-freeness in the Classified Stable Matching model due to Huang (in: Procedings of 21st annual ACM-SIAM symposium on discrete algorithms (SODA2010), SIAM, Philadelphia, pp 1235–1253, 2010), i.e., each hospital has lower and upper quotas on subsets of doctors. We show that, for this model, deciding the existence of an envy-free matching is NP-hard in general, but solvable in polynomial time if quotas are paramodular.


Stable matchings Envy-free matchings Lower quotas Polynomial time algorithm Paramodular functions 



I wish to thank the anonymous reviewers whose comments have benefited the paper greatly. I gratefully acknowledge Yasushi Kawase for his helpful comments. This work was supported by JST CREST, Grant Number JPMJCR14D2, Japan.


  1. 1.
    Arulselvan, A., Cseh, Á., Groß, M., Manlove, D.F., Matuschke, J.: Matchings with lower quotas: algorithms and complexity. Algorithmica 80, 1–24 (2016)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT, Electronic Colloquium on Computational Complexity Report (2003)Google Scholar
  3. 3.
    Biró, P., Fleiner, T., Irving, R.W., Manlove, D.F.: The college admissions problem with lower and common quotas. Theor. Comput. Sci. 411, 3136–3153 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Ehlers, L., Hafalir, I.E., Yenmez, M.B., Yildirim, M.A.: School choice with controlled choice constraints: hard bounds versus soft bounds. J. Econ. Theory 153, 648–683 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fleiner, T.: A matroid generalization of the stable matching polytope. In: Proceedings of the 8th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2001), Lecture Notes in Computer Science 2081, pp. 105–114. Springer, Berlin (2001)Google Scholar
  6. 6.
    Fleiner, T.: A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28, 103–126 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Fleiner, T., Kamiyama, N.: A matroid approach to stable matchings with lower quotas. Math. Oper. Res. 41, 734–744 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Fragiadakis, D., Iwasaki, A., Troyan, P., Ueda, S., Yokoo, M.: Strategyproof matching with minimum quotas. ACM Trans. Econ. Comput. 4, 6:1–6:40 (2015)MathSciNetGoogle Scholar
  9. 9.
    Frank, A.: Generalized polymatroids, Finite and Infinite Sets. In: Proceedings of the 6th Hungarian Combinatorial Colloquium, 1981, Colloquia Mathematica Societatis János Bolyai, 37, 285–294. North-Holland (1984)Google Scholar
  10. 10.
    Frank, A.: Connections in Combinatorial Optimization. Oxford Lecture Series in Mathematics and its Applications, vol. 38. Oxford University Press, Oxford (2011)zbMATHGoogle Scholar
  11. 11.
    Frank, A., Tardos, É.: Generalized polymatroids and submodular flows. Math. Prog. 42, 489–563 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Frieze, A.M.: Complexity of a 3-dimensional assignment problem. Eur. J. Oper. Res. 13, 161–164 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69, 9–15 (1962)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discret. Appl. Math. 11, 223–232 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Garey, M. R., Johnson, D. S.: 29: Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman. San Francisco (1979)Google Scholar
  16. 16.
    Goto, M., Iwasaki, A., Kawasaki, Y., Kurata, R., Yasuda, Y., Yokoo, M.: Strategyproof matching with regional minimum and maximum quotas. Artif. Intell. 235, 40–57 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)zbMATHGoogle Scholar
  18. 18.
    Hamada, K., Iwama, K., Miyazaki, S.: The hospitals, residents problem with quota lower bounds. In: Proceedings of 19th Annual European Symposium on Algorithms (ESA 2011), Lecture Notes in Computer Science, vol. 6942, pp. 180–191. Springer, Berlin (2011)Google Scholar
  19. 19.
    Hamada, K., Iwama, K., Miyazaki, S.: The hospitals/residents problem with lower quotas. Algorithmica 74, 440–465 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Hassin, R.: On Network Flows, Ph.D. Thesis, Yale University (1978)Google Scholar
  21. 21.
    Hassin, R.: Minimum cost flow with set-constraints. Networks 12, 1–21 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Hatfield, J.W., Milgrom, P.R.: Matching with contracts. Am. Econ. Rev. 95, 913–935 (2005)CrossRefGoogle Scholar
  23. 23.
    Huang, C.C.: Classified stable matching. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2010), pp. 1235–1253. SIAM, Philadelphia (2010)Google Scholar
  24. 24.
    Kamada, Y., Kojima, F.: Efficient matching under distributional constraints: theory and applications. Am. Econ. Rev. 105, 67–99 (2014)CrossRefGoogle Scholar
  25. 25.
    Kamada, Y., Kojima, F.: Stability concepts in matching under distributional constraints. J. Econ. Theory 168, 107–142 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  26. 26.
    Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific Publishing, Singapore (2013)CrossRefzbMATHGoogle Scholar
  27. 27.
    Mnich, M., Schlotter, I.: Stable marriage with covering constraints–a complete computational trichotomy. In: Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017), pp. 320–332. Springer, Berlin (2017)Google Scholar
  28. 28.
    Murota, K.: Discrete Convex Analysis. SIAM, Philadelphia (2003)CrossRefzbMATHGoogle Scholar
  29. 29.
    Murota, K.: Discrete convex analysis: A tool for economics and game theory. J. Mech. Inst. Des. 1, 151–273 (2016)Google Scholar
  30. 30.
    Murota, K., Shioura, A.: M-convex function on generalized polymatroid. Math. Oper. Res. 24, 95–105 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  31. 31.
    Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Oper. Res. 41, 338–350 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92, 991–1016 (1984)CrossRefGoogle Scholar
  33. 33.
    Roth, A.E.: Stability and polarization of interests in job matching. Econometrica 52, 47–57 (1984)CrossRefzbMATHGoogle Scholar
  34. 34.
    Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica 54, 425–427 (1986)MathSciNetCrossRefGoogle Scholar
  35. 35.
    Roth, A .E., Sotomayor, M .A .O.: Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, Cambridge (1992)zbMATHGoogle Scholar
  36. 36.
    Tardos, É.: Generalized matroids and supermodular colourings. In: Lovász, L., Recski, A. (eds.) Matroid Theory, pp. 359–382. Amsterdam, North-Holland (1985)Google Scholar
  37. 37.
    Tardos, É.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5, 247–255 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  38. 38.
    Wu, Q., Roth, A.E.: The lattice of envy-free matchings. Mimeo (2016)Google Scholar
  39. 39.
    Yokoi, Y.: A generalized polymatroid approach to stable matchings with lower quotas. Math. Oper. Res. 42, 238–255 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  40. 40.
    Yokoi, Y.: Envy-free matchings with lower quotas. In: Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC 2017), pp. 67:1–67:12 (2017)Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.National Institute of InformaticsTokyoJapan

Personalised recommendations