Strongly Stable and Maximum Weakly Stable Noncrossing Matchings

• Published in: Algorithmica 2021-09, Vol.83 (9), p.2678-2696
• Main Authors: Hamada, Koki, Miyazaki, Shuichi, Okamoto, Kazuya
• Format: Article
• Language: English
• Subjects: Algorithm Analysis and Problem Complexity; Algorithms; Computer Science; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Lists; Matching; Mathematics of Computing; Polynomials; Special Issue on Combinatorial Algorithms (IWOCA 2020); Theory of Computation
• ISSN: 0178-4617; 1432-0541
• DOI: 10.1007/s00453-021-00832-9

In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchings , where participants of each side are aligned on each of two parallel lines, and no two matching edges are allowed to cross each other. They defined two stability notions, strongly stable noncrossing matching ( SSNM ) and weakly stable noncrossing matching ( WSNM ), depending on the strength of blocking pairs. They proved that a WSNM always exists and presented an O ( n 2 ) -time algorithm to find one for an instance with n men and n women. They also posed open questions of the complexities of determining existence of an SSNM and finding a largest WSNM. In this paper, we show that both problems are solvable in polynomial time. Our algorithms are applicable to extensions where preference lists may include ties, except for one case which we show to be NP-complete. This NP-completeness holds even if each person's preference list is of length at most two and ties appear in only men's preference lists. To complement this intractability, we show that the problem is solvable in polynomial time if the length of preference lists of one side is bounded by one (but that of the other side is unbounded).