1. Lecture Notes in Computer Science;P Biró,2010
2. Dean, B., Jalasutram, R.: Factor revealing LPs and stable matching with ties and incomplete lists. In: Proceedings of the 3rd International Workshop on Matching Under Preferences, pp. 42–53 (2015)
3. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9–15 (1962)
4. Gärdenfors, P.: Match making: assignments based on bilateral preferences. Behav. Sci. 20(3), 166–173 (1975)
5. Goko, H., Makino, K., Miyazaki, S., Yokoi, Y.: Maximally satisfying lower quotas in the hospitals/residents problem with ties. In: 39th International Symposium on Theoretical Aspects of Computer Science (2022)