We consider one-to-one, one-sided matching (roommate) problems in which agents can either be matched as pairs or remain single. We introduce a so-called bi-choice graph for each pair of stable matchings and characterize its structure. Exploiting this structure we obtain as a corollary the...

We consider the generalization of Shapley and Scarf''s (1974) model of trading indivisible objects (houses) to so-called multiple-type housing markets. We show (Theorem 1) that the prominent solution for these markets, the coordinate-wise core rule, is second-best incentive compatible. In other...

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...

We discuss a problem concerning Dasgupta, Hammond, and Maskin''s (1979) definition of a rich domain and a very well-known result they established for these domains: on rich domains, if a social choice function is implementable in Nash strategies, then it is truthfully implementable in dominant...