Stable Marriage Problem
| dc.contributor.advisor | Tsegaye, Yirgalem (PhD) | |
| dc.contributor.author | Mulugeta, Ehite | |
| dc.date.accessioned | 2018-07-13T05:53:57Z | |
| dc.date.accessioned | 2023-11-04T12:32:08Z | |
| dc.date.available | 2018-07-13T05:53:57Z | |
| dc.date.available | 2023-11-04T12:32:08Z | |
| dc.date.issued | 2015-07-08 | |
| dc.description.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. | en_US |
| dc.identifier.uri | http://etd.aau.edu.et/handle/123456789/8394 | |
| dc.language.iso | en | en_US |
| dc.publisher | Addis Ababa University | en_US |
| dc.subject | Stable Marriage Problem | en_US |
| dc.title | Stable Marriage Problem | en_US |
| dc.type | Thesis | en_US |