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...

Full description

Saved in:
Bibliographic Details
Main Author: Hui, Peizheng
Other Authors: Shu Jian Jun
Format: Final Year Project
Language:English
Published: 2015
Subjects:
Online Access:http://hdl.handle.net/10356/65856
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-65856
record_format dspace
spelling sg-ntu-dr.10356-658562023-03-04T19:09:28Z Mathematical strategame theory Hui, Peizheng Shu Jian Jun School of Mechanical and Aerospace Engineering DRNTU::Engineering::General::Economic and business aspects 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 Bachelor of Engineering (Mechanical Engineering) 2015-12-31T02:00:58Z 2015-12-31T02:00:58Z 2015 2015 Final Year Project (FYP) http://hdl.handle.net/10356/65856 en Nanyang Technological University 75 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering::General::Economic and business aspects
spellingShingle DRNTU::Engineering::General::Economic and business aspects
Hui, Peizheng
Mathematical strategame theory
description 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
author2 Shu Jian Jun
author_facet Shu Jian Jun
Hui, Peizheng
format Final Year Project
author Hui, Peizheng
author_sort Hui, Peizheng
title Mathematical strategame theory
title_short Mathematical strategame theory
title_full Mathematical strategame theory
title_fullStr Mathematical strategame theory
title_full_unstemmed Mathematical strategame theory
title_sort mathematical strategame theory
publishDate 2015
url http://hdl.handle.net/10356/65856
_version_ 1759858006124658688