NP-Complete Stable Matching Problems

@article{Ronn1990NPCompleteSM,
  title={NP-Complete Stable Matching Problems},
  author={Eytan Ronn},
  journal={J. Algorithms},
  year={1990},
  volume={11},
  pages={285-304}
}
This paper concerns the complexity analysis of the roommate problem and intern assignment problem with couples. These are two special cases of the matching problems known as stable matching. The roommate problem is that of assigning a set of people to rooms of exactly two occupants in accordance with the preferences of the members of the set. The intern… CONTINUE READING