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 …

We study Nash implementation in many-to-one matching problems also known as college admission problems [Gale and … although subsolutions of the stable many-to-one matching rule do not in general satisfy no veto power, monotonicity is not only …

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 …

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

-proof mechanism that is constrained efficient, i.e. that always produces a stable matching that is not Pareto-dominated by another … stable matching. We characterize all solvable priority structures satisfying the following two restrictions: (A) Either there …

This paper studies the possibility of strategy-proof rules yielding satisfactory solutions to matching problems …. Alcalde and Barberá (1994) show that efficient 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 efficiency to the weaker condition of …

(partially) group strategy-proof, in appropriate domains of definition. That is so for solutions to matching, division, cost …