{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T03:21:20Z","timestamp":1781925680910,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001742","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["551145\/14"],"award-info":[{"award-number":["551145\/14"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Alexander von Humboldt-Stiftung","award":["Postdoctoral fellowship"],"award-info":[{"award-number":["Postdoctoral fellowship"]}]},{"name":"FP7 People: Marie-Curie Actions","award":["631163.11"],"award-info":[{"award-number":["631163.11"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,6,11]]},"DOI":"10.1145\/3219166.3219168","type":"proceedings-article","created":{"date-parts":[[2018,9,21]],"date-time":"2018-09-21T12:42:08Z","timestamp":1537533728000},"page":"269-286","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Stable Marriage with Multi-Modal Preferences"],"prefix":"10.1145","author":[{"given":"Jiehua","family":"Chen","sequence":"first","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Piotr","family":"Skowron","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1257\/000282805774669637"},{"key":"e_1_3_2_2_2_1","volume-title":"Stable Matching with Uncertain Pairwise Preferences Proceedings of AAMAS-17","author":"Aziz H.","unstructured":"H. Aziz , P. Bir\u00f3 , T. Fleiner , S. Gaspers , R. de Haan , N. Mattei , and B. Rastegari . 2017 . Stable Matching with Uncertain Pairwise Preferences Proceedings of AAMAS-17 . 344--352. H. Aziz, P. Bir\u00f3, T. Fleiner, S. Gaspers, R. de Haan, N. Mattei, and B. Rastegari. 2017. Stable Matching with Uncertain Pairwise Preferences Proceedings of AAMAS-17. 344--352."},{"key":"e_1_3_2_2_3_1","volume-title":"Proceedings of SAGT-16","author":"Aziz H.","unstructured":"H. Aziz , P. Bir\u00f3 , S. Gaspers , R. de Haan , N. Mattei , and B. Rastegari . 2016. Stable Matching with Uncertain Linear Preferences . Proceedings of SAGT-16 . 195--206. H. Aziz, P. Bir\u00f3, S. Gaspers, R. de Haan, N. Mattei, and B. Rastegari. 2016. Stable Matching with Uncertain Linear Preferences. Proceedings of SAGT-16. 195--206."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808746"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90072-6"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-013-9236-y"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.07.005"},{"key":"e_1_3_2_2_8_1","unstructured":"P. Bir\u00f3. 2017. Applications of Matching under Preferences. Trends in Computational Social Choice. 345--373.  P. Bir\u00f3. 2017. Applications of Matching under Preferences. Trends in Computational Social Choice. 345--373."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-013-0320-9"},{"key":"e_1_3_2_2_10_1","volume-title":"The Theory of Committees and Elections","author":"Black D.","unstructured":"D. Black . 1958. The Theory of Committees and Elections . Cambridge University Press . D. Black. 1958. The Theory of Committees and Elections. Cambridge University Press."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2014.6867518"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"R. Bredereck J. Chen U.P. Finnendahl and R. Niedermeier. 2017. Stable Roommate with Narcissistic Single-Peaked and Single-Crossing Preferences Proceedings of ADT-17. 315--330.  R. Bredereck J. Chen U.P. Finnendahl and R. Niedermeier. 2017. Stable Roommate with Narcissistic Single-Peaked and Single-Crossing Preferences Proceedings of ADT-17. 315--330.","DOI":"10.1007\/978-3-319-67504-6_22"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2693068.2693079"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-012-0717-8"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.mathsocsci.2015.11.002"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"J. Chen R. Niedermeier and P. Skowron. 2018. Stable Marriage with Multi-Modal Preferences. Technical Report. arXiv:1801.02693 {cs.MA cs.DS}.  J. Chen R. Niedermeier and P. Skowron. 2018. Stable Marriage with Multi-Modal Preferences. Technical Report. arXiv:1801.02693 {cs.MA cs.DS}.","DOI":"10.1145\/3219166.3219168"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-016-1011-y"},{"key":"e_1_3_2_2_18_1","volume-title":"A Theory of Data","author":"Coombs C.H.","unstructured":"C.H. Coombs . 1964. A Theory of Data . John Wiley and Sons . C.H. Coombs. 1964. A Theory of Data. John Wiley and Sons."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"M. Cygan F.V. Fomin L. Kowalik D. Lokshtanov D. Marx M. Pilipczuk M. Pilipczuk and S. Saurabh. 2015. Parameterized Algorithms. Springer.   M. Cygan F.V. Fomin L. Kowalik D. Lokshtanov D. Marx M. Pilipczuk M. Pilipczuk and S. Saurabh. 2015. Parameterized Algorithms. Springer.","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1010"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"R.G. Downey and M.R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer.   R.G. Downey and M.R. Fellows. 2013. Fundamentals of Parameterized Complexity. Springer.","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229050"},{"key":"e_1_3_2_2_23_1","unstructured":"E. Elkind M. Lackner and D. Peters. 2017. Structured Preferences. Trends in Computational Social Choice. 187--207.  E. Elkind M. Lackner and D. Peters. 2017. Structured Preferences. Trends in Computational Social Choice. 187--207."},{"key":"e_1_3_2_2_24_1","volume-title":"Proceedings of ECAI-08","author":"Escoffier B.","year":"2008","unstructured":"B. Escoffier , J. Lang , and M. \u00d6zt\u00fcrk . 2008 . Single-Peaked Consistency and its Complexity . In Proceedings of ECAI-08 . 366--370. B. Escoffier, J. Lang, and M. \u00d6zt\u00fcrk. 2008. Single-Peaked Consistency and its Complexity. In Proceedings of ECAI-08. 366--370."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-016-9687-z"},{"key":"e_1_3_2_2_26_1","unstructured":"J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer.   J. Flum and M. Grohe. 2006. Parameterized Complexity Theory. Springer."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.4169\/amer.math.monthly.120.05.386"},{"key":"e_1_3_2_2_28_1","unstructured":"M.R. Garey and D.S. Johnson. 1979. Computers and Intractability--A Guide to the Theory of NP-Completeness. W. H. Freeman and Company.   M.R. Garey and D.S. Johnson. 1979. Computers and Intractability--A Guide to the Theory of NP-Completeness. W. H. Freeman and Company."},{"key":"e_1_3_2_2_29_1","unstructured":"D. Gusfield and R.W. Irving. 1989. The Stable Marriage Problem--Structure and Algorithms. MIT Press.   D. Gusfield and R.W. Irving. 1989. The Stable Marriage Problem--Structure and Algorithms. MIT Press."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)00179-P"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"R.W. Irving. 2016. Optimal Stable Marriage. Encyclopedia of Algorithms Ming-Yang Kao (Ed.). 1470--1473.  R.W. Irving. 2016. Optimal Stable Marriage. Encyclopedia of Algorithms Ming-Yang Kao (Ed.). 1470--1473.","DOI":"10.1007\/978-1-4939-2864-4_271"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"R.W. Irving. 2016. Stable Marriage. Encyclopedia of Algorithms Ming-Yang Kao (Ed.). 2060--2064.  R.W. Irving. 2016. Stable Marriage. Encyclopedia of Algorithms Ming-Yang Kao (Ed.). 2060--2064.","DOI":"10.1007\/978-1-4939-2864-4_393"},{"key":"e_1_3_2_2_33_1","volume-title":"Proceedings of ICALP-99","author":"Iwama K.","unstructured":"K. Iwama , D. Manlove , S. Miyazaki , and Y. Morita . 1999. Stable Marriage with Incomplete Lists and Ties . In Proceedings of ICALP-99 . 443--452. K. Iwama, D. Manlove, S. Miyazaki, and Y. Morita. 1999. Stable Marriage with Incomplete Lists and Ties. In Proceedings of ICALP-99. 443--452."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICKS.2008.7"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"B. Klaus D.F. Manlove and F. Rossi. 2016. Matching under Preferences. Handbook of Computational Social Choice.  B. Klaus D.F. Manlove and F. Rossi. 2016. Matching under Preferences. Handbook of Computational Social Choice.","DOI":"10.1017\/CBO9781107446984.015"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmateco.2009.05.007"},{"key":"e_1_3_2_2_37_1","unstructured":"D. Knuth. 1976. Mariages Stables. Les Presses de L'Universit\u00e9 de Montr\u00e9al.  D. Knuth. 1976. Mariages Stables. Les Presses de L'Universit\u00e9 de Montr\u00e9al."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805800"},{"key":"e_1_3_2_2_39_1","volume-title":"Algorithmics of Matching Under Preferences","author":"Manlove D.F.","unstructured":"D.F. Manlove . 2013. Algorithmics of Matching Under Preferences . Vol. Vol. 2 . WorldScientific . D.F. Manlove. 2013. Algorithmics of Matching Under Preferences. Vol. Vol. 2. WorldScientific."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"D. Manlove. 2016. Hospitals\/Residents Problem. Encyclopedia of Algorithms Ming-Yang Kao (Ed.).  D. Manlove. 2016. Hospitals\/Residents Problem. Encyclopedia of Algorithms Ming-Yang Kao (Ed.).","DOI":"10.1007\/978-1-4939-2864-4_180"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00206-7"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670129"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.2307\/1907926"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.2307\/2296779"},{"key":"e_1_3_2_2_45_1","volume-title":"Proc. ISAAC-17","author":"Miyazaki S.","unstructured":"S. Miyazaki and K. Okamoto . 2017. Jointly Stable Matchings . In Proc. ISAAC-17 . 56:1--56:12. S. Miyazaki and K. Okamoto. 2017. Jointly Stable Matchings. In Proc. ISAAC-17. 56:1--56:12."},{"key":"e_1_3_2_2_46_1","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"Niedermeier R.","unstructured":"R. Niedermeier . 2006. Invitation to Fixed-Parameter Algorithms . Oxford University Press . R. Niedermeier. 2006. Invitation to Fixed-Parameter Algorithms. Oxford University Press."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0058"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0047-2727(77)90005-6"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.97.3.828"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"A.E. Roth and M.A.O. Sotomayor. 1992. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Part of Econometric Society Monographs.  A.E. Roth and M.A.O. Sotomayor. 1992. Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis. Part of Econometric Society Monographs.","DOI":"10.1016\/S1574-0005(05)80019-0"},{"key":"e_1_3_2_2_51_1","unstructured":"P. Schweitzer. 2017. A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry Proceedings of ICALP-17. 66:1--66:14.  P. Schweitzer. 2017. A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry Proceedings of ICALP-17. 66:1--66:14."},{"key":"e_1_3_2_2_52_1","volume-title":"Hardness Results for Tournament Isomorphism and Automorphism Proceedings of MFCS-07","author":"Wagner F.","year":"2007","unstructured":"F. Wagner . 2007 . Hardness Results for Tournament Isomorphism and Automorphism Proceedings of MFCS-07 . 572--583. F. Wagner. 2007. Hardness Results for Tournament Isomorphism and Automorphism Proceedings of MFCS-07. 572--583."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1657"}],"event":{"name":"EC '18: ACM Conference on Economics and Computation","location":"Ithaca NY USA","acronym":"EC '18","sponsor":["SIGecom Special Interest Group on Economics and Computation"]},"container-title":["Proceedings of the 2018 ACM Conference on Economics and Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219168","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219166.3219168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:13Z","timestamp":1750212433000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219166.3219168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":53,"alternative-id":["10.1145\/3219166.3219168","10.1145\/3219166"],"URL":"https:\/\/doi.org\/10.1145\/3219166.3219168","relation":{},"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"2018-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}