{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T00:51:11Z","timestamp":1768697471422,"version":"3.49.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,5,14]],"date-time":"2009-05-14T00:00:00Z","timestamp":1242259200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00453-009-9315-2","type":"journal-article","created":{"date-parts":[[2009,5,13]],"date-time":"2009-05-13T13:08:50Z","timestamp":1242220130000},"page":"5-18","source":"Crossref","is-referenced-by-count":48,"title":["Three-Sided Stable Matchings with Cyclic Preferences"],"prefix":"10.1007","volume":"58","author":[{"given":"P\u00e9ter","family":"Bir\u00f3","sequence":"first","affiliation":[]},{"given":"Eric","family":"McDermid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,14]]},"reference":[{"key":"9315_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Blum, A., Sandholm, T.: Clearing algorithms for barter-exchange markets: Enabling nationwide kidney exchanges. In: Proceedings of ACM-EC 2007: the Eighth ACM Conference on Electronic Commerce (2007)","DOI":"10.1145\/1250910.1250954"},{"key":"9315_CR2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0165-4896(88)90053-4","volume":"16","author":"A. Alkan","year":"1988","unstructured":"Alkan, A.: Non-existence of stable threesome matchings. Math. Soc. Sci. 16, 207\u2013209 (1988)","journal-title":"Math. Soc. Sci."},{"key":"9315_CR3","unstructured":"Bir\u00f3, P.: The stable matching problem and its generalizations: an algorithmic and game theoretical approach. PhD thesis, Budapest University of Technology and Economics (2007)"},{"issue":"5","key":"9315_CR4","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ipl.2006.09.012","volume":"101","author":"P. Bir\u00f3","year":"2007","unstructured":"Bir\u00f3, P., Cechl\u00e1rov\u00e1, K.: Inapproximability of the kidney exchange problem. Inf. Process. Lett. 101(5), 199\u2013202 (2007)","journal-title":"Inf. Process. Lett."},{"key":"9315_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2004.08.012","volume":"289","author":"E. Boros","year":"2004","unstructured":"Boros, E., Gurvich, V., Jaslar, S., Krasner, D.: Stable matchings in three-sided systems with cyclic preferences. Discrete Math. 289, 1\u201310 (2004)","journal-title":"Discrete Math."},{"key":"9315_CR6","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T., Manlove, D.F.: The kidney exchange game. In: Zadik-Stirn, L., Drobne, S., (eds.) Proc. SOR\u201905, pp.\u00a077\u201383 (2005)"},{"key":"9315_CR7","unstructured":"Cechl\u00e1rov\u00e1, K., Lacko, V.: The kidney exchange game: How hard is to find a donor? IM Preprint, 4\/2006 (2006)"},{"issue":"1","key":"9315_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.mathsocsci.2006.03.005","volume":"52","author":"K. Eriksson","year":"2006","unstructured":"Eriksson, K., Sj\u00f6strand, J., Strimling, P.: Three-dimensional stable matching with cyclic preferences. Math. Soc. Sci. 52(1), 77\u201387 (2006)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"9315_CR9","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9\u201315 (1962)","journal-title":"Am. Math. Mon."},{"issue":"3","key":"9315_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(85)90074-5","volume":"11","author":"D. Gale","year":"1985","unstructured":"Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discrete Appl. Math. 11(3), 223\u2013232 (1985)","journal-title":"Discrete Appl. Math."},{"key":"9315_CR11","series-title":"Foundations of Computing Series","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. Foundations of Computing Series. MIT Press, Cambridge (1989)"},{"key":"9315_CR12","series-title":"Lecture Notes in Comput. Sci.","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1007\/978-3-540-75520-3_50","volume-title":"Algorithms\u2014ESA 2007","author":"C.-C. Huang","year":"2007","unstructured":"Huang, C.-C.: Two\u2019s company, three\u2019s a crowd: stable family and threesome roommate problems. In: Algorithms\u2014ESA 2007. Lecture Notes in Comput. Sci., vol. 4698, pp. 558\u2013569. Springer, Berlin (2007)"},{"key":"9315_CR13","unstructured":"Huang, C.-C.: Circular stable matching and 3-way kidney transplant. In: Proceedings of MATCH-UP: Matching Under Preferences\u2014Algorithms and Complexity, Satellite Workshop of ICALP 2008, pp.\u00a067\u201378 (2008)"},{"issue":"4","key":"9315_CR14","doi-asserted-by":"crossref","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 \u201cstable roommates\u201d problem. J. Algorithms 6(4), 577\u2013595 (1985)","journal-title":"J. Algorithms"},{"key":"9315_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipl.2007.02.003","volume":"103","author":"R.W. Irving","year":"2007","unstructured":"Irving, R.W.: The cycle-roommates problem: a hard case of kidney exchange. Inf. Proces. Lett. 103, 1\u20134 (2007)","journal-title":"Inf. Proces. Lett."},{"key":"9315_CR16","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.transproceed.2004.12.096","volume":"37","author":"K.M. Keizer","year":"2005","unstructured":"Keizer, K.M., de Klerk, M., Haase-Kromwijk, B.J.J.M., Weimar, W.: The Dutch algorithm for allocation in living donor kidney exchange. Transplant. Proc. 37, 589\u2013591 (2005)","journal-title":"Transplant. Proc."},{"key":"9315_CR17","volume-title":"Mariages Stables","author":"D.E. Knuth","year":"1976","unstructured":"Knuth, D.E.: Mariages Stables. Les Presses de L\u2019Universit\u00e9 de Montr\u00e9al, Montr\u00e9al (1976)"},{"issue":"1\u20132","key":"9315_CR18","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 276(1\u20132), 261\u2013279 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9315_CR19","unstructured":"New England Program for Kidney Exchange. http:\/\/www.nepke.org"},{"issue":"2","key":"9315_CR20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C. Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.S.: Three-dimensional stable matching problems. SIAM J. Discrete Math. 4(2), 245\u2013252 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"9315_CR21","doi-asserted-by":"crossref","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. J. Algorithms 11, 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"issue":"2","key":"9315_CR22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0304-4068(77)90004-0","volume":"4","author":"A.E. Roth","year":"1977","unstructured":"Roth, A.E., Postlewaite, A.: Weak versus strong domination in a market with indivisible goods. J.\u00a0Math.\u00a0Econ. 4(2), 131\u2013137 (1977)","journal-title":"J.\u00a0Math.\u00a0Econ."},{"key":"9315_CR23","first-page":"457","volume":"119","author":"A.E. Roth","year":"2004","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, U.M.: Kidney exchange. J. Econ. Theory 119, 457\u2013488 (2004)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"9315_CR24","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1257\/000282805774669989","volume":"95","author":"A.E. Roth","year":"2005","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, U.M.: A kidney exchange clearinghouse in New England. Am. Econ. Rev. Pap. Proc. 95(2), 376\u2013380 (2005)","journal-title":"Am. Econ. Rev. Pap. Proc."},{"issue":"2","key":"9315_CR25","doi-asserted-by":"crossref","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, U.M.: Pairwise kidney exchange. J. Econ. Theory 125(2), 151\u2013188 (2005)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"9315_CR26","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"A.E. Roth","year":"2007","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, U.M.: Coincidence of wants in markets with compatibility based preferences. Am. Econ. Rev. 97(3), 828\u2013851 (2007)","journal-title":"Am. Econ. Rev."},{"issue":"5","key":"9315_CR27","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1097\/01.tp.0000195775.77081.25","volume":"81","author":"S.L. Saidman","year":"2006","unstructured":"Saidman, S.L., Roth, A.E., S\u00f6nmez, T., \u00dcnver, U.M., Delmonico, S.L.: Increasing the opportunity of live kidney donation by matching for two and three way exchanges. Transplantation 81(5), 773\u2013782 (2006)","journal-title":"Transplantation"},{"key":"9315_CR28","doi-asserted-by":"crossref","first-page":"1883","DOI":"10.1001\/jama.293.15.1883","volume":"293","author":"S.L. Segev","year":"2005","unstructured":"Segev, S.L., Gentry, S.E., Warren, D.S., Reeb, B., Montgomery, R.A.: Kidney paired donation and optimizing the use of live donor organs. J. Am. Med. Assoc. 293, 1883\u20131890 (2005)","journal-title":"J. Am. Med. Assoc."},{"issue":"1","key":"9315_CR29","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L.S. Shapley","year":"1974","unstructured":"Shapley, L.S., Scarf, H.E.: On cores and indivisibility. J. Math. Econ. 1(1), 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"issue":"4","key":"9315_CR30","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/S0097539789169483","volume":"23","author":"A. Subramanian","year":"1994","unstructured":"Subramanian, A.: A new approach to stable matching problems. SIAM J. Comput. 23(4), 671\u2013700 (1994)","journal-title":"SIAM J. Comput."},{"key":"9315_CR31","unstructured":"UK Transplant. http:\/\/www.uktransplant.org.uk"},{"key":"9315_CR32","unstructured":"United Network for Organ Sharing. http:\/\/www.unos.org"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9315-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9315-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9315-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:04Z","timestamp":1559137504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9315-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,14]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9315"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9315-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,14]]}}}