Stable marriage with multi-modal preferences

DOI10.1016/J.JCSS.2026.103778MaRDI QIDQ7262355zbMATH OpenFDO

Authors Jiehua Chen, Rolf Niedermeier, Piotr Skowron

Publication date 11 June 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2026.103778

zbMATH Keywords

global stabilitygraph isomorphismindividual stabilitymultiple preferencespair stabilityparameterized complexitystable matching

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A characterization of the single-crossing domain
• A Multivariate Complexity Analysis of Lobbying in Multiple Referenda
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• A polynomial-time randomized reduction from tournament isomorphism to tournament asymmetry
• Algorithmics of matching under preferences. With a foreword by Kurt Mehlhorn
• An Exploration in the Theory of Optimum Income Taxation
• Are there any nicely structured preference profiles nearby?
• Assessing the computational complexity of multi-layer subgraph detection
• Average parameterization and partial kernelization for computing medians
• Bistable versions of the marriages and roommates problems
• College Admissions and the Stability of Marriage
• College admissions with stable score-limits
• Fundamentals of parameterized complexity
• Hard variants of stable marriage.
• Hardness Results for Tournament Isomorphism and Automorphism
• scientific article; zbMATH DE number 3148878 (Why is no real title available?)
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 3558960 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 477584 (Why is no real title available?)
• scientific article; zbMATH DE number 1405659 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Jointly stable matchings
• Matching under preferences
• Multidimensional Manhattan preferences
• On limited nondeterminism and the complexity of the V-C dimension
• Parameterized algorithms
• Parametrized complexity theory.
• Recognizing one-dimensional Euclidean preference profiles
• Stable marriage and indifference
• Stable marriage with general preferences
• Stable matching with preferences derived from a psychological model
• Stable matching with uncertain linear preferences
• Stable matching with uncertain pairwise preferences
• Stable roommate with narcissistic, single-peaked, and single-crossing preferences
• The one-dimensional Euclidean domain: finitely many obstructions are not enough

This page was built for publication: Stable marriage with multi-modal preferences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262355)