1. Archer, A., Williamson, D.P.: Faster approximation algorithms for the minimum latency problem. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 88–96 (2003)
2. Abdulkadiroglu, A., Pathak, P.A., Roth, A.E.: Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match. American Economic Review 99(5), 1954–1978 (2009)
3. Erdil, A., Haluk, E.: What’s the Matter with Tie-Breaking? Improving Efficiency in School Choice, Working Paper, Department of Economics, University of Oxford (2007)
4. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly 69, 9–15 (1962)
5. Halldorsson, M.M., Irving, R.W., Iwama, K., Manlove, D., Miyazaki, S., Morita, Y., Scott, S.: Approximability results for stable marriage problems with ties. Theor. Comput. Sci. 306(1-3), 431–447 (2003)