On graphs and marriages
Date of Publication
1999
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
This thesis presents and verifies the works of Balinski and Ratier on Graphs and Marriages published in the The American Mathematical Monthly (1998). It centers on a marriage game where there are two distinct, finite sets of players M (the 'men) and W (the women ), each player has strict preference order over those players of the opposite set whom he/she considers acceptable. A matching in a marriage game is a set of marriages among consenting players and some players who may be celibate.
The fundamental idea in the analysis of a marriage game is that each player is a rational soul who seeks to optimize his/her preferences. It aims to verify the stability of matchings in marriage graphs and to present proofs of some of the theorems in the article Graphs and Marriages. One important result shows that the set of all stable matchings in a marriage graph forms a distributive lattice.
Abstract Format
html
Language
English
Format
Accession Number
TU09224
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
111 leaves
Recommended Citation
Aguilera, G. A., & Swing, R. A. (1999). On graphs and marriages. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16556
