Back to search

Georgia Institute of Technology

Distributive lattices, stable matchings, and robust solutions

Abstract

dc:description.abstract

The stable matching problem, first presented by mathematical economists Gale and Shapley, has been studied extensively since its introduction. As a result, a remarkably rich literature on the problem has accumulated in both theory and practice. In this thesis we further extend our understanding on several algorithmic and structural aspects of stable matching. We summarize the main contributions of the thesis as follows: generalizing stable matching to maximum weight stable matching; finding stable matchings that are robust to shifts; generalizing Birkhoff's Theorem, and providing an application to robust stable matching.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Computer Science
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Mai, Tung
Advisor dc:contributor.advisor
  • Vazirani, Vijay V.
Committee members dc:contributor.committeemember
  • Garg, Jugal
  • Mihail, Milena
  • Singh, Mohit
  • Thomas, Robin

Subjects

dc:subject × 2

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/60238

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Mai, Tung. Distributive lattices, stable matchings, and robust solutions. Doctoral thesis, Georgia Institute of Technology, 2018. http://hdl.handle.net/1853/60238