Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

Distributional constraints are common features in many real matching markets, such as medical residency matching, school admissions, and teacher assignment. We develop a general theory of matching mechanisms under distributional constraints. We identify the necessary and sufficient condition on...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

In two-sided matching markets, stable mechanisms are vulnerable to various kinds of manipulations. This paper investigates conditions for the student-optimal stable mechanism (SOSM) and the college-optimal stable mechanism (COSM) to be immune to manipulations via capacities and pre-arranged...

In two-sided matching markets, stable mechanisms are vulnerable to various kinds of manipulations. This paper investigates conditions for the student-optimal stable mechanism (SOSM) and the college-optimal stable mechanism (COSM) to be immune to manipulations via capacities and pre-arranged...

Roth is the major force in creating a vibrant field of matching theory and its application to market design. In doing so, he has discovered many properties of the stable matching problem (especially from the strategic viewpoint of game theory), studied real-life cases to test the relevance of...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...