For the many-to-one matching model we give a procedure to partition the set of substitutable preference profiles into equivalence classes with the property that all profiles in the same class have the same set of stable matchings. This partition allows to reduce the amount of information required by centralized stable mechanisms. © 2007 Springer Verlag.
- Substitutable preferences
Martínez, R., Massó, J., Neme, A., & Oviedo, J. (2008). On the invariance of the set of stable matchings with respect to substitutable preference profiles. International Journal of Game Theory, 36, 497-518. https://doi.org/10.1007/s00182-007-0080-7