Back to search

University of Waterloo

Structure in Stable Matching Problems

Abstract

dc:description.abstract

In this thesis we provide two contributions to the study of structure in stable matching problems. The first contribution is a short new proof for the integrality of Rothblum’s linear description of the convex hull of incidence vectors of stable matchings in bipartite graphs. The key feature of our proof is to show that extreme points of the formulation must have a 0, 1-component. The second contribution is a computer search procedure for instances of cyclic stable matching problems with three genders as proposed by Knuth. We provide sufficient conditions for the existence of a stable matching in this context. We also investigate bijections of the problem instance vertex set to itself which preserve the set of stable matchings (up to permutation). Such bijections define “symmetric” problem instances. We study this notion of symmetry, and use it to cut down on the number of problem instances in our search. We implemented our proposed computational procedure in Java and end with a discussion of the results running computational experiments using our code on problem instances of size 5.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Toth, William Justin
Advisor dc:contributor.advisor
  • Koenemann, Jochen

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/11099

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Toth, William Justin. Structure in Stable Matching Problems. University of Waterloo, 2016. http://hdl.handle.net/10012/11099