1. Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges. In: EC 2007: Proceedings of the 8th ACM Conference on Electronic Commerce, pp. 295–304. ACM Press, New York (2007)
2. Abraham, D.J., Irving, R.W., Telikepalli, K., Mehlhorn, K.: Popular matchings. In: Proceedings of SODA 2005 the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 424–432. ACM Press, New York (2005)
3. Abraham, D.J., Levavi, A., Manlove, D.F., O’Malley, G.: The stable roommates problem with globally-ranked pairs. Technical Report TR-2007-257, University of Glasgow, Department of Computing Science (September 2007)
4. Arkin, E.M., Efrat, A., Mitchell, J.S.B., Polishchuk, V.: Geometric Stable Roommates. Manuscript (2007),
http://www.ams.sunysb.edu/~kotya/pages/geomSR.pdf
5. Bartholdi, J.J., Trick, M.A.: Stable matchings with preferences derived from a psychological model. Operations Research Letters 5, 165–169 (1986)