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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
