  We present a class of one-to-one matching models with perfectly transferable
utility. We discuss identification and inference in these separable models, and
we show how their comparative statics are readily analyzed.
