Two-sided markets model interactions between two groups of participants who have preferences over the other side. Classic examples include the assignment of students to schools or doctors to hospitals. The central focus of this thesis is on mechanisms that produce stable matchings. These are matchings in which there is no pair of participants who would prefer to be with each other rather than with their current partner. The analysis concentrates on the mathematical properties of stable matchings, such as their existence, side-optimality, and susceptibility to manipulation. While some mechanisms are manipulation-proof for the proposing side, the other side may still improve their outcome by misreporting preferences. In this thesis, we formally study manipulation of preference lists and identify the conditions under which strategic behavior leads to more favorable outcomes.
|
