In this paper the well-known Stable Marriage Problem is considered once again. The name of\ud this programming problem comes from the terms in which it was first described :\ud A certain community consists of n men and n women. Each person ranks\ud those of the opposite sex in accordance with his or her preferences for a marriage\ud partner. We seek a satisfactory way of marrying off all members of the community.\ud (. . . ) We call a set of marriages unstable (. . . ) if under it there are a man and\ud a woman who are not married to each other but prefer each other to their actual\ud mates.\ud Question: For any pattern of preferences is it possible to find a stable set of marriages
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.