Distributive lattices, stable matchings, and robust solutions

Distributive lattice;Stable matching

Mai, Tung ; Vazirani, Vijay Computer Science Garg, Jugal Mihail, Milena Singh, Mohit Thomas, Robin ; Vazirani, Vijay

University:Georgia Institute of Technology

Department:Computer Science

关键词: Distributive lattice;    Stable matching;   

Others  :  https://smartech.gatech.edu/bitstream/1853/60238/1/MAI-DISSERTATION-2018.pdf

美国|英语

来源: SMARTech Repository

【 摘 要 】

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.