Monotonicity and Nash Implementation in Matching Markets with Contracts

We consider general two-sided matching markets, so-called matching with contracts markets as introduced by Hatfield and Milgrom (2005), and analyze (Maskin) monotonic and Nash implementable solutions. We show that for matching with contracts markets the stable correspondence is monotonic and implementable (Theorems 1 and 3). Furthermore, any solution that is Pareto efficient, individually rational, and monotonic is a supersolution of the stable correspondence (Theore m 2). In other words, the stable correspondence is the minimal solution that is Pareto efficient, individually rational, and implementable.