Pairwise Preferences in the Stable Marriage Problem

Cseh, Ágnes and Juhos, Attila (2019) Pairwise Preferences in the Stable Marriage Problem. In: 36th International Symposium on Theoretical Aspects of Computer Science. LIPIcs (126). Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH; Dagstuhl Publishing, Saarbrücken/Wadern, pp. 1-16.

Preview

Text LIPIcs-STACS-2019-21.pdf Available under License Creative Commons Attribution. Download (480kB) | Preview

Abstract

We study the classical, two-sided stable marriage problem under pairwise preferences. In the most general setting, agents are allowed to express their preferences as comparisons of any two of their edges and they also have the right to declare a draw or even withdraw from such a comparison. This freedom is then gradually restricted as we specify six stages of orderedness in the preferences, ending with the classical case of strictly ordered lists. We study all cases occurring when combining the three known notions of stability – weak, strong and super-stability – under the assumption that each side of the bipartite market obtains one of the six degrees of orderedness. By designing three polynomial algorithms and two NP-completeness proofs we determine the complexity of all cases not yet known, and thus give an exact boundary in terms of preference structure between tractable and intractable cases.

Actions (login required)

Edit Item