Assortive matching in a nontransferable world

Progress in the application of matching models to environments in which the utility between matching partners is not fully transferable has been hindered by a lack of characterization results analogous to those that are known for transferable utility. We present sufficient conditions for matching to be monotone that are simple to express and easy to verify. We illustrate their application with some examples that are of independent interest.