A Many-to-Many "Rural Hospital Theorem"

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.