We study path-independent choice rules applied to a matching context. We use a classic representation of these choice rules to introduce a powerful technique for matching theory. Using this technique, we provide a deferred acceptance algorithm for many-to-many matching markets with contracts and...

We study many-to-one matchings, such as the assignment of students to colleges, where the students have preferences over the other students who would attend the same college. It is well known that the core of this model may be empty, without strong assumptions on agents' preferences. We...

We propose a methodology for estimating preference parameters in matching models. Our estimator applies to repeated observations of matchings among a fixed group of individuals. Our estimator is based on the stability conditions in matching models; we consider both transferable (TU) and...

We present an experimental study of decentralized two‐sided matching markets with no transfers. Experimental participants are informed of everyone's preferences and can make arbitrary nonbinding match offers that get finalized when a period of market inactivity has elapsed. Several insights...