The Stable Matching Problem* Graphs and Competition a Preference Oriented Exploration of the Stable Matching Problem
Date of Award
2007
Document Type
Thesis
Degree Name
Bachelors
Department
Natural Sciences
Second Department
Social Sciences
First Advisor
Mullins, David
Keywords
Stable, Matching, Problem, Preferences
Area of Concentration
Mathematics
Abstract
Several techniques are introduced to study the stable matching problem. Graphs are constructed that serve as an alternative way to view matchings and preference interactions. A metric is found that measures the distance between individual preference lists. Maps between the stable matching problem and the optimal assignment problem are used to illustrate how the models relegate the issue of dividing the utility of the two agents being paired under each model. Preference lists are treated as the objects of study to evaluate competition and utility in the stable matching problem.
Recommended Citation
Tanner, David, "The Stable Matching Problem* Graphs and Competition a Preference Oriented Exploration of the Stable Matching Problem" (2007). Theses & ETDs. 3865.
https://digitalcommons.ncf.edu/theses_etds/3865