decentralized matching markets such as multiple applications, late rejections of offers, and universities unable to fill all their …

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems …. Alcalde and Barberá (1994) show that effcient and individually rational matching rules are manipulable in the one …-to-one matching model. We pursue the possibility of strategy-proof matching rules by relaxing effciency to the weaker condition of …

the Gale-Shapley Deferred Acceptance (DA) mechanism versus the Iterative Deferred Acceptance Mechanism (IDAM), a matching …

We introduce a new mechanism for matching students to schools or universities, denoted Iterative Deferred Acceptance …), the matching that is produced is the Student Optimal Stable Matching. Moreover, under imperfect information, students …

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 …

-sided matching models. We show that the NYC/Boston mechanism fails to satisfy these fairness properties. We then propose two new …