On graphs and marriages
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 prefer...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1999
|
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16556 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-17069 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-170692021-12-02T04:32:32Z On graphs and marriages Aguilera, Genevieve A. Swing, Reginald A. 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. 1999-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16556 Bachelor's Theses English Animo Repository |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| description |
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. |
| format |
text |
| author |
Aguilera, Genevieve A. Swing, Reginald A. |
| spellingShingle |
Aguilera, Genevieve A. Swing, Reginald A. On graphs and marriages |
| author_facet |
Aguilera, Genevieve A. Swing, Reginald A. |
| author_sort |
Aguilera, Genevieve A. |
| title |
On graphs and marriages |
| title_short |
On graphs and marriages |
| title_full |
On graphs and marriages |
| title_fullStr |
On graphs and marriages |
| title_full_unstemmed |
On graphs and marriages |
| title_sort |
on graphs and marriages |
| publisher |
Animo Repository |
| publishDate |
1999 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16556 |
| _version_ |
1772835349037318144 |