Stable Marriage Problem
No Thumbnail Available
Date
2015-07-08
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Addis Ababa University
Abstract
The stable marriage problem is a well-known problem of matching women to men to achieve a
certain type of "stability". Each person expresses a strict preference ordering over the members of
the opposite sex. The goal is to match women and men so that there are no two people of opposite
sex who would both rather be matched with each other than with their current partners. Gale and
Shapley gave an algorithm to solve this problem based on a series of proposals of the women to
the men (or vice versa). The stable marriage problem has a wide variety of practical applications,
ranging from matching resident doctors to hospitals, job applicants to be assigned by the ministry
of education, having a living kidney donor as well as in market trading.
Description
Keywords
Stable Marriage Problem