摘要

We show that the full version of the so-called %26apos;rural hospital theorem%26apos; 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%26apos; preferences satisfy substitutability, the domain of weakly separable preferences is also maximal for the rural hospital theorem to hold.

  • 出版日期2014-10