Mathematical strategame theory
The stable matching problem is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences of each element. In 1962, David Gale and Lloyd Shapley proved that, for any equal number of men and women, it is always possible to solve the Stable mat...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Final Year Project |
| 語言: | English |
| 出版: |
2015
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/65856 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | The stable matching problem is the problem of finding a stable matching between two equally sized sets of elements given an ordering of preferences of each element. In 1962, David Gale and Lloyd Shapley proved that, for any equal number of men and women, it is always possible to solve the Stable matching problem and make all marriages stable. It’s famous Gale-Shapley Algorithm. It also successfully applied on the National Residency Matching Program, has improved the stable matching rate between medical students and hospitals. It also extends to the more complex similar problems: Stable roommate problem, Hospitals/residents problem and hospitals/residents problem with couples. Some of them may not have stable matching solutions in the extreme conditions in the real world. However the more extensions and modification will be made to the basic stable matching algorithm, the more algorithms will be applicable for real world instances |
|---|