{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:59:06Z","timestamp":1777399146578,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540771043","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77105-0_48","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:59:37Z","timestamp":1196665177000},"page":"431-444","source":"Crossref","is-referenced-by-count":13,"title":["The Stable Roommates Problem with Globally-Ranked Pairs"],"prefix":"10.1007","author":[{"given":"David J.","family":"Abraham","sequence":"first","affiliation":[]},{"given":"Ariel","family":"Levavi","sequence":"additional","affiliation":[]},{"given":"David F.","family":"Manlove","sequence":"additional","affiliation":[]},{"given":"Gregg","family":"O\u2019Malley","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/1250910.1250954","volume-title":"EC 2007: Proceedings of the 8th ACM Conference on Electronic Commerce","author":"D.J. Abraham","year":"2007","unstructured":"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\u2013304. ACM Press, New York (2007)"},{"key":"48_CR2","first-page":"424","volume-title":"Proceedings of SODA 2005 the 16th ACM-SIAM Symposium on Discrete Algorithms","author":"D.J. Abraham","year":"2005","unstructured":"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\u2013432. ACM Press, New York (2005)"},{"key":"48_CR3","unstructured":"Abraham, D.J., Levavi, A., Manlove, D.F., O\u2019Malley, G.: The stable roommates problem with globally-ranked pairs. Technical Report TR-2007-257, University of Glasgow, Department of Computing Science (September 2007)"},{"key":"48_CR4","unstructured":"Arkin, E.M., Efrat, A., Mitchell, J.S.B., Polishchuk, V.: Geometric Stable Roommates. Manuscript (2007), \n                      \n                        http:\/\/www.ams.sunysb.edu\/~kotya\/pages\/geomSR.pdf"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"J.J. Bartholdi","year":"1986","unstructured":"Bartholdi, J.J., Trick, M.A.: Stable matchings with preferences derived from a psychological model. Operations Research Letters\u00a05, 165\u2013169 (1986)","journal-title":"Operations Research Letters"},{"issue":"2","key":"48_CR6","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1006\/game.1999.0779","volume":"33","author":"K.S. Chung","year":"2000","unstructured":"Chung, K.S.: On the existence of stable roommate matchings. Games and Economic Behavior\u00a033(2), 206\u2013230 (2000)","journal-title":"Games and Economic Behavior"},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"1812","DOI":"10.1056\/NEJMp038228","volume":"350","author":"F.L. Delmonico","year":"2004","unstructured":"Delmonico, F.L.: Exchanging kidneys - advances in living-donor transplantation. New England Journal of Medicine\u00a0350, 1812\u20131814 (2004)","journal-title":"New England Journal of Medicine"},{"key":"48_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Path, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0022-0000(92)90048-N","volume":"45","author":"T. Feder","year":"1992","unstructured":"Feder, T.: A new fixed point approach for stable networks and stable marriages. Journal of Computer and System Sciences\u00a045, 233\u2013284 (1992)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"48_CR10","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"H.N. Gabow","year":"1991","unstructured":"Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for general graph matching problems. Journal of the ACM\u00a038(4), 815\u2013853 (1991)","journal-title":"Journal of the ACM"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. American Mathematical Monthly\u00a069, 9\u201315 (1962)","journal-title":"American Mathematical Monthly"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/bs.3830200304","volume":"20","author":"P. G\u00e4rdenfors","year":"1975","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Behavioural Sciences\u00a020, 166\u2013173 (1975)","journal-title":"Behavioural Sciences"},{"issue":"2","key":"48_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/0097-3165(74)90053-3","volume":"16","author":"E. Gergely","year":"1974","unstructured":"Gergely, E.: A simple method for constructing doubly diagonalized latin squares. Journal of Combinatorial Theory, Series A\u00a016(2), 266\u2013272 (1974)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"48_CR14","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1046\/j.1523-1755.2000.00195.x","volume":"58","author":"D.W. Gjertson","year":"2000","unstructured":"Gjertson, D.W., Cecka, J.M.: Living unrelated donor kidney transplantation. Kidney International\u00a058, 491\u2013499 (2000)","journal-title":"Kidney International"},{"key":"48_CR15","volume-title":"The Stable Marriage Problem: Structure and Algorithms","author":"D. Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"48_CR16","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"R.W. Irving","year":"1985","unstructured":"Irving, R.W.: An efficient algorithm for the stable roommates problem. Journal of Algorithms\u00a06, 577\u2013595 (1985)","journal-title":"Journal of Algorithms"},{"key":"48_CR17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"R.W. Irving","year":"2002","unstructured":"Irving, R.W., Manlove, D.F.: The Stable Roommates Problem with Ties. Journal of Algorithms\u00a043, 85\u2013105 (2002)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"48_CR18","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"R.W. Irving","year":"2006","unstructured":"Irving, R.W., Michail, D., Mehlhorn, K., Paluch, K., Telikepalli, K.: Rank-maximal matchings. ACM Transactions on Algorithms\u00a02(4), 602\u2013610 (2006)","journal-title":"ACM Transactions on Algorithms"},{"key":"48_CR19","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory. No. 29 in Annals of Discrete Mathematics. North-Holland (1986)"},{"issue":"1-2","key":"48_CR20","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"D.F. Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoretical Computer Science\u00a0276(1-2), 261\u2013279 (2002)","journal-title":"Theoretical Computer Science"},{"key":"48_CR21","unstructured":"Manlove, D.F., O\u2019Malley, G.: Student project allocation with preferences over projects. In: Proceedings of ACiD 2005 the 1st Algorithms and Complexity in Durham workshop. Texts in Algorithmics, vol.\u00a04, pp. 69\u201380. KCL Publications (2005)"},{"key":"48_CR22","unstructured":"Mehlhorn, K., Michail, D.: Network problems with non-polynomial weights and applications (Unpublished manuscript)"},{"key":"48_CR23","first-page":"17","volume-title":"Proceedings of FOCS 1980 the 21st Annual IEEE Symposium on Foundations of Computer Science","author":"S. Micali","year":"1980","unstructured":"Micali, S., Vazirani, V.V.: An O(|V|. |E|) algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS 1980 the 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 17\u201327. IEEE Computer Society Press, Los Alamitos (1980)"},{"key":"48_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0196-6774(90)90007-2","volume":"11","author":"E. Ronn","year":"1990","unstructured":"Ronn, E.: NP-complete stable matching problems. Journal of Algorithms\u00a011, 285\u2013304 (1990)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"48_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"A.E. Roth","year":"2005","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Pairwise kidney exchange. Journal of Economic Theory\u00a0125(2), 151\u2013188 (2005)","journal-title":"Journal of Economic Theory"},{"issue":"2","key":"48_CR26","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1162\/0033553041382157","volume":"119","author":"A.E. Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Kidney exchange. Quarterly Journal of Economics\u00a0119(2), 457\u2013488 (2004)","journal-title":"Quarterly Journal of Economics"},{"key":"48_CR27","unstructured":"Scott, S.: A study of stable marriage problems with ties. PhD thesis, University of Glasgow, Department of Computing Science (2005)"},{"issue":"1","key":"48_CR28","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0196-6774(91)90028-W","volume":"12","author":"J.J.M. Tan","year":"1991","unstructured":"Tan, J.J.M.: A necessary and sufficient condition for the existence of a complete stable matching. J. Algorithms\u00a012(1), 154\u2013178 (1991)","journal-title":"J. Algorithms"},{"key":"48_CR29","series-title":"Lecture Notes in Computer Science","first-page":"153","volume-title":"Algorithms and Computation","author":"K. Telikepalli","year":"2006","unstructured":"Telikepalli, K., Shah, C.: Efficient algorithms for weighted rank-maximal matchings and related problems. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 153\u2013162. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77105-0_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:32Z","timestamp":1619521232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77105-0_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771043"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77105-0_48","relation":{},"subject":[]}}