{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T15:38:59Z","timestamp":1775403539604,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030304720","type":"print"},{"value":"9783030304737","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30473-7_22","type":"book-chapter","created":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T23:02:36Z","timestamp":1568588556000},"page":"329-342","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the Existence of Three-Dimensional Stable Matchings with Cyclic Preferences"],"prefix":"10.1007","author":[{"given":"Chi-Kit","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Gregory","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0165-4896(88)90053-4","volume":"16","author":"A Alkan","year":"1988","unstructured":"Alkan, A.: Nonexistence of stable threesome matchings. Math. Soc. Sci. 16(2), 207\u2013209 (1988)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00453-009-9315-2","volume":"58","author":"P Bir\u00f3","year":"2010","unstructured":"Bir\u00f3, P., McDermid, E.: Three-sided stable matchings with cyclic preferences. Algorithmica 58(1), 5\u201318 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"22_CR3","first-page":"1","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), 1\u201310 (2004)","journal-title":"Discrete Math."},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/j.comnet.2012.09.021","volume":"57","author":"L Cui","year":"2013","unstructured":"Cui, L., Jia, W.: Cyclic stable matching for three-sided networking services. Comput. Netw. 57(1), 351\u2013363 (2013)","journal-title":"Comput. Netw."},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0165-4896(03)00073-8","volume":"46","author":"VI Danilov","year":"2003","unstructured":"Danilov, V.I.: Existence of stable matchings in some three-sided systems. Math. Soc. Sci. 46(2), 145\u2013148 (2003)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"22_CR6","doi-asserted-by":"publisher","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."},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-93031-2_13","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"G Escamocher","year":"2018","unstructured":"Escamocher, G., O\u2019Sullivan, B.: Three-dimensional matching instances are rich in stable matchings. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 182\u2013197. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_13"},{"issue":"4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-016-9687-z","volume":"59","author":"L Farczadi","year":"2016","unstructured":"Farczadi, L., Georgiou, K., K\u00f6nemann, J.: Stable marriage with general preferences. Theory Comput. Syst. 59(4), 683\u2013699 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","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."},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.mathsocsci.2016.04.006","volume":"82","author":"J Hofbauer","year":"2016","unstructured":"Hofbauer, J.: $$d$$-dimensional stable matching with cyclic preferences. Math. Soc. Sci. 82, 72\u201376 (2016)","journal-title":"Math. Soc. Sci."},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-75520-3_50","volume-title":"Algorithms \u2013 ESA 2007","author":"C-C Huang","year":"2007","unstructured":"Huang, C.-C.: Two\u2019s company, three\u2019s a crowd: stable family and threesome roommates problems. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 558\u2013569. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_50"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s00453-009-9356-6","volume":"58","author":"CC Huang","year":"2010","unstructured":"Huang, C.C.: Circular stable matching and 3-way kidney transplant. Algorithmica 58(1), 137\u2013150 (2010)","journal-title":"Algorithmica"},{"key":"22_CR13","volume-title":"Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms. American Mathematical Society, Providence (1997)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Lam, C.K., Plaxton, C.G.: On the existence of three-dimensional stable matchings with cyclic preferences (2019). arXiv:1905.02844","DOI":"10.1007\/978-3-030-30473-7_22"},{"key":"22_CR15","doi-asserted-by":"publisher","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific, Singapore (2013)"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/0404023","volume":"4","author":"C Ng","year":"1991","unstructured":"Ng, C., Hirschberg, D.: Three-dimensional stable matching problems. SIAM J. Discrete Math. 4(2), 245\u2013252 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"22_CR17","unstructured":"Pashkovich, K., Poirrier, L.: Three-dimensional stable matching with cyclic preferences (2018). arXiv:1807.05638"},{"issue":"4","key":"22_CR18","doi-asserted-by":"publisher","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":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-35843-2_4","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"GJ Woeginger","year":"2013","unstructured":"Woeginger, G.J.: Core stability in hedonic coalition formation. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 33\u201350. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35843-2_4"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30473-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:35:31Z","timestamp":1709811331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30473-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030304720","9783030304737"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30473-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/corelab.ntua.gr\/sagt2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}