Advertisement

Socially Stable Matchings in the Hospitals/Residents Problem

  • Georgios Askalidis
  • Nicole Immorlica
  • Augustine Kwanashie
  • David F. Manlove
  • Emmanouil Pountourakis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8037)

Abstract

In the Hospitals/Residents (HR) problem, agents are partitioned into hospitals and residents. Each agent wishes to be matched to an agent (or agents) in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking pairs, i.e., no pair of agents that prefer each other to their assigned matches. Such a situation is undesirable as it could lead to a deviation in which the blocking pair form a private arrangement outside the matching. This however assumes that the blocking pair have social ties or communication channels to facilitate the deviation. Relaxing the stability definition to take account of the potential lack of social ties between agents can yield larger stable matchings.

In this paper, we define the Hospitals/Residents problem under Social Stability (HRSS) which takes into account social ties between agents by introducing a social network graph to the HR problem. Edges in the social network graph correspond to resident-hospital pairs in the HR instance that know one another. Pairs that do not have corresponding edges in the social network graph can belong to a matching M but they can never block M. Relative to a relaxed stability definition for HRSS, called social stability, we show that socially stable matchings can have different sizes and the problem of finding a maximum socially stable matching is NP-hard, though approximable within 3/2. Furthermore we give polynomial time algorithms for special cases of the problem.

Keywords

Leaf Node Stable Match Social Stability Acceptable Pair Preference List 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdulkadiroǧlu, A., Pathak, P.A., Roth, A.E.: The Boston public school match. American Economic Review 95(2), 368–371 (2005)CrossRefGoogle Scholar
  2. 2.
    Abdulkadiroǧlu, A., Pathak, P.A., Roth, A.E.: The New York City high school match. American Economic Review 95(2), 364–367 (2005)CrossRefGoogle Scholar
  3. 3.
    Arcaute, E., Vassilvitskii, S.: Social networks and stable matchings in the job market. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 220–231. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Askalidis, G., Immorlica, N., Pountourakis, E.: Socially stable matchings. CoRR Technical Report 1302.3309, http://arxiv.org/abs/1302.3309
  5. 5.
    Askalidis, G., Immorlica, N., Kwanashie, A., Manlove, D.F., Pountourakis, E.: Socially stable matchings in the Hospitals / Residents problem. CoRR Technical Report 1303.2041, http://arxiv.org/abs/1303.2041
  6. 6.
    Biró, P., Manlove, D.F., Mittal, S.: Size versus stability in the marriage problem. Theoretical Computer Science 411, 1828–1841 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Cechlárová, K., Fleiner, T.: Stable roommates with free edges. Technical Report 2009-01, Egerváry Research Group on Combinatorial Optimization, Budapest (2009)Google Scholar
  8. 8.
    Cheng, C., McDermid, E.: Maximum locally stable matchings. In: Proc. MATCH-UP 2012, pp. 51–62 (2012)Google Scholar
  9. 9.
    Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press (1989)Google Scholar
  11. 11.
    Hoefer, M.: Local matching dynamics in social networks. Information and Computation 222, 20–35 (2013)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Hoefer, M., Wagner, L.: Locally stable marriage with strict preferences. In: Smotrovs, J., Yakaryilmaz, A. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 620–631. Springer, Heidelberg (2013)Google Scholar
  13. 13.
    Irving, R.W.: Matching medical students to pairs of hospitals: A new variation on a well-known theme. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 381–392. Springer, Heidelberg (1998)Google Scholar
  14. 14.
    Király, Z.: Linear time local approximation algorithm for maximum stable marriage. In: Proc. MATCH-UP 2012, pp. 99–110 (2012)Google Scholar
  15. 15.
    Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific (2013)Google Scholar
  16. 16.
    McDermid, E.: A 3/2-approximation algorithm for general stable marriage. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 689–700. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy 92(6), 991–1016 (1984)CrossRefGoogle Scholar
  18. 18.
    Roth, A.E., Sotomayor, M.A.O.: Two-sided matching: a study in game-theoretic modeling and analysis. Cambridge University Press (1990)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Georgios Askalidis
    • 1
  • Nicole Immorlica
    • 1
    • 2
  • Augustine Kwanashie
    • 3
  • David F. Manlove
    • 3
  • Emmanouil Pountourakis
    • 1
  1. 1.Dept. of Electrical Engineering and Computer ScienceNorthwestern UniversityUSA
  2. 2.Microsoft Research New EnglandUK
  3. 3.School of Computing ScienceUniversity of GlasgowUK

Personalised recommendations