Abstract
We show that the full version of the so-called ‘rural hospital theorem’ generalizes to many-to-many matching problems where agents on both sides of the problem have substitutable and weakly separable preferences. We reinforce our result by showing that when agents’ preferences satisfy substitutability, the domain of weakly separable preferences is also maximal for the rural hospital theorem to hold.
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.
