Abstract
The Hospitals/Residents problem is a many-to-one extension of the stable marriage problem. In its instance, each hospital specifies a quota, i.e., an upper bound on the number of positions it provides. It is well-known that in any instance, there exists at least one stable matching, and finding one can be done in polynomial time. In this paper, we consider an extension in which each hospital specifies not only an upper bound but also a lower bound on its number of positions. In this setting, there can be instances that admit no stable matching, but the problem of asking if there is a stable matching is solvable in polynomial time. In case there is no stable matching, we consider the problem of finding a matching that is “as stable as possible”, namely, a matching with a minimum number of blocking pairs. We show that this problem is hard to approximate within the ratio of (|H| + |R|)1 − ε for any positive constant ε where H and R are the sets of hospitals and residents, respectively. We tackle this hardness from two different angles. First, we give an exponential-time exact algorithm for a special case where all the upper bound quotas are one. This algorithm runs in time O(t 2(|H|(|R| + t))t + 1) for instances whose optimal cost is t. Second, we consider another measure for optimization criteria, i.e., the number of residents who are involved in blocking pairs. We show that this problem is still NP-hard but has a polynomial-time \(\sqrt{|R|}\)-approximation algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, D.J., Biró, P., Manlove, D.F.: “Almost stable” matchings in the roommates problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 1–14. Springer, Heidelberg (2006)
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)
Aldershof, B., Carducci, O.M.: Stable matchings with couples. Discrete Applied Mathematics 68, 203–207 (1996)
Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities – an O(n 1/4) approximation for densest k-subgraph. In: Proc. STOC 2010, pp. 201–210 (2010)
Biró, P., Fleiner, T., Irving, R.W., Manlove, D.F.: The College Admissions problem with lower and common quotas. Theoretical Computer Science 411(34-36), 3136–3153 (2010)
Biró, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theoretical Computer Science 411(16-18), 1828–1841 (2010)
Canadian Resident Matching Service (CaRMS), http://www.carms.ca/
Feige, U.: Relations between average case complexity and approximation complexity. In: Proc. STOC 2002, pp. 534–543 (2002)
Gabow, H.N.: An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In: Proc. STOC 1983, pp. 448–456 (1983)
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69, 9–15 (1962)
Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Applied Mathematics 11, 223–232 (1985)
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)
Hamada, K., Iwama, K., Miyazaki, S.: The hospitals/residents problem with quota lower bounds. In: Proc. MATCH-UP (satellite workshop of ICALP 2008), pp. 55–66 (2008)
Hamada, K., Iwama, K., Miyazaki, S.: The hospitals/residents problem with quota lower bounds (manuscript) , http://www.lab2.kuis.kyoto-u.ac.jp/~shuichi/ESA11/esa11-final-long.pdf
Hamada, K., Iwama, K., Miyazaki, S.: An improved approximation lower bound for finding almost stable maximum matchings. Information Processing Letters 109(18), 1036–1040 (2009)
Huang, C.-C.: Classified stable matching. In: Proc. SODA 2010, pp. 1235–1253 (2010)
Irving, R.W., Manlove, D.F., Scott, S.: The hospitals/Residents problem with ties. In: Halldórsson, M.M. (ed.) SWAT 2000. LNCS, vol. 1851, pp. 259–271. Springer, Heidelberg (2000)
Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discrete Applied Math. 156(15), 2959–2977 (2008)
Khot, S.: Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In: Proc. FOCS 2004, pp. 136–145 (2004)
Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-Line algorithms for weighted bipartite matching and stable marriages. Theoretical Computer Science 127(2), 255–267 (1994)
Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29, 410–421 (2001)
McDermid, E.J., Manlove, D.F.: Keeping partners together: algorithmic results for the hospitals/residents problem with couples. Journal of Combinatorial Optimization 19(3), 279–303 (2010)
Ronn, E.: NP-complete stable matching problems. J. Algorithms 11, 285–304 (1990)
Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Political Economy 92(6), 991–1016 (1984)
Vinterbo, S.A.: A stab at approximating minimum subadditive join. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 214–225. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hamada, K., Iwama, K., Miyazaki, S. (2011). The Hospitals/Residents Problem with Quota Lower Bounds. In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-23719-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23718-8
Online ISBN: 978-3-642-23719-5
eBook Packages: Computer ScienceComputer Science (R0)