{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T02:19:31Z","timestamp":1773368371290,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319675039","type":"print"},{"value":"9783319675046","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-67504-6_22","type":"book-chapter","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T02:03:20Z","timestamp":1506132200000},"page":"315-330","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences"],"prefix":"10.1007","author":[{"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[]},{"given":"Jiehua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ugo Paavo","family":"Finnendahl","sequence":"additional","affiliation":[]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/s00355-010-0476-3","volume":"36","author":"M\u00c1 Ballester","year":"2011","unstructured":"Ballester, M.\u00c1., Haeringer, G.: A characterization of the single-peaked domain. Soc. Choice Welf. 36(2), 305\u2013322 (2011)","journal-title":"Soc. Choice Welf."},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.geb.2011.02.004","volume":"73","author":"S Barber\u00e0","year":"2011","unstructured":"Barber\u00e0, S., Moreno, B.: Top monotonicity: a common root for single peakedness, single crossing and the median voter result. Game Econ. Behav. 73(2), 345\u2013359 (2011)","journal-title":"Game Econ. Behav."},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"JJ Bartholdi","year":"1986","unstructured":"Bartholdi, J.J., Trick, M.: Stable matching with preferences derived from a psychological model. Oper. Res. Lett. 5(4), 165\u2013169 (1986)","journal-title":"Oper. Res. Lett."},{"key":"22_CR4","volume-title":"The Theory of Committees and Elections","author":"D Black","year":"1958","unstructured":"Black, D.: The Theory of Committees and Elections. Cambridge University Press, Cambridge (1958)"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00355-012-0717-8","volume":"41","author":"R Bredereck","year":"2013","unstructured":"Bredereck, R., Chen, J., Woeginger, G.J.: A characterization of the single-crossing domain. Soc. Choice Welf. 41(4), 989\u2013998 (2013)","journal-title":"Soc. Choice Welf."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.mathsocsci.2015.11.002","volume":"79","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Chen, J., Woeginger, G.J.: Are there any nicely structured preference profiles nearby? Math. Soc. Sci. 79, 61\u201373 (2016)","journal-title":"Math. Soc. Sci."},{"key":"22_CR7","volume-title":"A Theory of Data","author":"CH Coombs","year":"1964","unstructured":"Coombs, C.H.: A Theory of Data. Wiley, New York (1964)"},{"issue":"2","key":"22_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"J Doignon","year":"1994","unstructured":"Doignon, J., Falmagne, J.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16(2), 218\u2013233 (1994)","journal-title":"J. Algorithms"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Clone structures in voters\u2019 preferences. In: Proceedings of EC 2012, pp. 496\u2013513 (2012)","DOI":"10.1145\/2229012.2229050"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Skowron, P.: A characterization of the single-peaked single-crossing domain. In: Proceedings of AAAI 2014, pp. 654\u2013660 (2014)","DOI":"10.1609\/aaai.v28i1.8821"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Lackner, M., Obraztsova, S.: The complexity of recognizing incomplete single-crossing preferences. In: Proceedings of AAAI 2015, pp. 865\u2013871, Long version available as manuscript on M. Lackers homepage (2015)","DOI":"10.1609\/aaai.v29i1.9321"},{"key":"22_CR12","unstructured":"Elkind, E., Lackner, M., Peters, D.: Structured preferences. In: Endriss, U. (ed.) Trends in Computational Social Choice. AI Access (2017). Upcoming. Draft online available"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity. In: Proceedings of ECAI 2008, pp. 366\u2013370 (2008)","DOI":"10.3233\/978-1-58603-891-5-366"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Fitzsimmons, Z.: Single-peaked consistency for weak orders is easy. Technical report. arXiv:1406.4829v3 [cs.GT] (2016)","DOI":"10.4204\/EPTCS.215.10"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Fitzsimmons, Z., Hemaspaandra, E.: Modeling single-peakedness for votes with ties. In: Proceedings of STAIRS 2016, vol. 284. Frontiers in Artificial Intelligence and Applications, pp. 63\u201374 (2016)","DOI":"10.3233\/978-1-61499-682-8-63"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/978-3-540-74466-5_88","volume-title":"Euro-Par 2007 Parallel Processing","author":"A-T Gai","year":"2007","unstructured":"Gai, A.-T., Lebedev, D., Mathieu, F., Montgolfier, F., Reynier, J., Viennot, L.: Acyclic preference systems in P2P networks. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol. 4641, pp. 825\u2013834. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74466-5_88"},{"issue":"5","key":"22_CR17","doi-asserted-by":"publisher","first-page":"386","DOI":"10.4169\/amer.math.monthly.120.05.386","volume":"120","author":"D Gale","year":"2013","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 120(5), 386\u2013391 (2013)","journal-title":"Am. Math. Mon."},{"key":"22_CR18","volume-title":"Computers and Intractability\u2013A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability\u2013A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"22_CR19","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)"},{"issue":"153","key":"22_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2224214","volume":"39","author":"H Hotelling","year":"1929","unstructured":"Hotelling, H.: Stability in competition. Econ. J. 39(153), 41\u201357 (1929)","journal-title":"Econ. J."},{"issue":"4","key":"22_CR21","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/0196-6774(85)90033-1","volume":"6","author":"RW 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"},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/jagm.2002.1219","volume":"43","author":"RW Irving","year":"2002","unstructured":"Irving, R.W., Manlove, D.: The stable roommates problem with ties. J. Algorithms 43(1), 85\u2013105 (2002)","journal-title":"J. Algorithms"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: Stable marriage and its relation to other combinatorial problems. CRM Proceedings & Lecture Notes, vol. 10. AMS (1997)","DOI":"10.1090\/crmp\/010"},{"key":"22_CR24","first-page":"19","volume":"7","author":"E Kujansuu","year":"1999","unstructured":"Kujansuu, E., Lindberg, T., M\u00e4kinen, E.: The stable roommates problem and chess tournament pairings. Divulgaciones Matem\u00e1ticas 7, 19\u201328 (1999)","journal-title":"Divulgaciones Matem\u00e1ticas"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Lackner, M.: Incomplete preferences in single-peaked electorates. In: Proceedings of AAAI 2014, pp. 742\u2013748 (2014)","DOI":"10.1609\/aaai.v28i1.8822"},{"key":"22_CR26","unstructured":"Lebedev, D., Mathieu, F., Viennot, L., Gai, A., Reynier, J., de Montgolfier, F.: On using matching theory to understand P2P network design. Technical report. arXiv:cs\/0612108v1 [cs.NI] (2006)"},{"key":"22_CR27","series-title":"Series on Theoretical Computer Science","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. Series on Theoretical Computer Science, vol. 2. WorldScientific, Singapore (2013)"},{"issue":"1","key":"22_CR28","first-page":"2.6:1","volume":"19","author":"DF Manlove","year":"2014","unstructured":"Manlove, D.F., O\u2019Malley, G.: Paired and altruistic kidney donation in the UK: algorithms and experimentation. ACM J. Exp. Algorithmics 19(1), 2.6:1\u20132.6:21 (2014)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"22_CR29","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2296779","volume":"38","author":"JA Mirrlees","year":"1971","unstructured":"Mirrlees, J.A.: An exploration in the theory of optimal income taxation. Rev. Econ. Stud. 38, 175\u2013208 (1971)","journal-title":"Rev. Econ. Stud."},{"issue":"3","key":"22_CR30","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0047-2727(77)90005-6","volume":"8","author":"KW Roberts","year":"1977","unstructured":"Roberts, K.W.: Voting over income tax schedules. J. Public Econ. 8(3), 329\u2013340 (1977)","journal-title":"J. Public Econ."},{"issue":"2","key":"22_CR31","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. J. Algorithms 11(2), 285\u2013304 (1990)","journal-title":"J. Algorithms"},{"key":"22_CR32","volume-title":"A Study in Game-Theoretic Modeling and Analysis","author":"AE Roth","year":"1990","unstructured":"Roth, A.E., Sotomayor, M., Matching, T.-S.: A Study in Game-Theoretic Modeling and Analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"2","key":"22_CR33","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jet.2005.04.004","volume":"125","author":"AE Roth","year":"2005","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Pairwise kidney exchange. J. Econ. Theor. 125(2), 151\u2013188 (2005)","journal-title":"J. Econ. Theor."},{"issue":"3","key":"22_CR34","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1257\/aer.97.3.828","volume":"97","author":"AE Roth","year":"2007","unstructured":"Roth, A.E., S\u00f6nmez, T., \u00dcnver, M.U.: Efficient kidney exchange: coincidence of wants in markets with compatibility-based preferences. Am. Econ. Rev. 97(3), 828\u2013851 (2007)","journal-title":"Am. Econ. Rev."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67504-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T21:39:43Z","timestamp":1750887583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67504-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319675039","9783319675046"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67504-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 September 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sma.uni.lu\/adt2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}