Pareto Optimal Matchings in Many-to-Many Markets with Ties
We consider Pareto-optimal matchings (POMs) in a many-to-many market of applicants and courses where applicants have preferences, which may include ties, over individual courses and lexicographic preferences over sets of courses. Since this is the most general setting examined so far in the literature, our work unifies and generalizes several known results. Specifically, we characterize POMs and introduce the Generalized Serial Dictatorship Mechanism with Ties (GSDT) that effectively handles ties via properties of network flows. We show that GSDT can generate all POMs using different priority orderings over the applicants, but it satisfies truthfulness only for certain such orderings. This shortcoming is not specific to our mechanism; we show that any mechanism generating all POMs in our setting is prone to strategic manipulation. This is in contrast to the one-to-one case (with or without ties), for which truthful mechanisms generating all POMs do exist.
KeywordsPareto optimality Many-to-many matching Serial dictatorship Truthfulness
- 8.Cechlárová, K., Eirinakis, P., Fleiner, T., Magos, D., Manlove, D., Mourtos, I., Oceľáková, E., Rastegari, B.: Pareto optimal matchings in many-to-many markets with ties. Technical Report 1507.02866, 2015. Accessed on http://arxiv.org/abs/1507.02866
- 10.Fujita, E., Lesca, J., Sonoda, A., Todo, T., Yokoo, M.: A complexity approach for core-selecting exchange with multiple indivisible goods under lexicographic preferences. In: Proceedings of AAAI 2015 (2015)Google Scholar
- 15.Krysta, P., Manlove, D., Rastegari, B., Zhang, J.: Size versus truthfulness in the house allocation problem. Technical report 1404.5245. A shorter version appeared in the Proceedings of EC 2014 (2014)Google Scholar