The revealed preference theory of stable matchings with one-sided preferences

We investigate the testable implications of the theory of stable matchings in two-sided matching markets with one-sided preferences. Our main result connects the revealed preference analysis to the well-known lattice structure of the set of stable matchings, and tests the rationalizability of a data set by analyzing the joins and meets of matchings.