Browsing Mathematics (Faculty of) by Subject "Stable Matching"
Now showing items 1-2 of 2
-
An Algorithm for Stable Matching with Approximation up to the Integrality Gap
(University of Waterloo, 2020-07-10)In the stable matching problem we are given a bipartite graph G = (A ∪ B, E) where A and B represent disjoint groups of agents, each of whom has ordinal preferences over the members of the opposite group. The goal is to ... -
Structure in Stable Matching Problems
(University of Waterloo, 2016-12-14)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 ...