UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

An Algorithm for Stable Matching with Approximation up to the Integrality Gap

Thumbnail Image

Files

Tofigzade_Natig.pdf (424.89 KB)

Date

2020-07-10

Authors

Tofigzade, Natig

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

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 find an assignment of agents in one group to those in the other such that no pair of agents prefer each other to their assignees. In this thesis we study the stable matching problem with ties and incomplete preferences. If agents are allowed to have ties and incomplete preferences, computing a stable matching of maximum cardinality is known to be NP-hard. Furthermore, it is known to be NP-hard to achieve a performance guarantee of 33/29 − ε (≈ 1.1379) and UGC-hard to attain that of 4/3 − ε (≈ 1.3333). We present a polynomial-time approximation algorithm with a performance guarantee of (3L − 2)/(2L − 1) where L is the maximum tie length. Our result matches the known lower bound on the integrality gap for the associated LP formulation.

Description

Keywords

Combinatorial Optimization, Stable Matching, Algorithmic Game Theory

LC Keywords

Citation

URI

http://hdl.handle.net/10012/16052

Collections

Theses
Combinatorics and Optimization