University of Nevada - Reno
A Computational Investigation into the Strict Core of the 4-player Restricted Houseswapping Game
Abstract
dc:description.abstractThis thesis investigates the strict core in Restricted Houseswapping Games with Ordinal Preferences (RHGOPs), introduced by Quint [18]. RHGOPs generalize classical matching models with ordinal preferences, such as the houseswapping game of Shapley and Scarf [24] and the marriage game of Gale and Shapley [9], by incorporating a restricted trading structure. While prior work shows that many restricted houseswapping games have non-empty strict core if strongly balanced, and many RHGOPs in the literature have a non-empty strict core if there are strict preferences, no analogous guarantee exists for the strict core for RHGOPs in general. We conjecture that every RHGOP with strict preferences and a strongly balanced trading structure has a non-empty strict core across all preference structures. We test this with an exhaustive computational analysis of all 220 possible trading structures in 4-player RHGOPs, identify the 167,077 strongly balanced trading structures via Birkhoff-von Neumann decomposition of select doubly stochastic matrices, and confirm that each has a non-empty strict core across all preferences. This supports the conjecture and reveals a new, smallest class of doubly stochastic matrices forwhich the Birkhoff algorithm fails to find all decompositions.
Degree
thesis:*- Level thesis:degree_level
- Master's Degree
- Department thesis:degree_department
- Mathematics
- Year dc:date.issued
- 2025
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Stewart, Owen Paul
- Advisor dc:contributor.advisor
-
- Quint, Thomas
- Committee members dc:contributor.committeemember
-
- Hurtado, Paul
- Tam, Tin-Yau
- Ariel Fernandez, Marcelo
Subjects
dc:subject × 5Rights
- Language dc:language.iso
- en_US, English
Identifiers
dc:identifier.*- Repository record dc:identifier.uri
- https://scholarwolf.unr.edu/handle/11714/11593