Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
