Abstract
A matching is called stable if it has no blocking pair, where a blocking pair is a man-woman pair, say (m, w), such that m and w are not matched with each other in the matching but if they get matched with each other, then both of them become better off. A matching is called non-crossing if it does not admit any pair of edges that cross each other when all men and women are arranged in two parallel vertical lines with men on one line and women on the other. Two notions of matchings that are stable as well as non-crossing have been identified in the literature, namely (i) weakly stable non-crossing matching (WSNM) and (ii) strongly stable non-crossing matching (SSNM). An SSNM is a non-crossing matching which is stable in the classical sense, whereas in a WSNM, a blocking pair satisfies an extra condition that it must not cross any matching edge. It is known that the problem of finding a WSNM, which always exists in an SMI instance, is polynomial time solvable. However, the problem of determining the existence of an SSNM in SMTI is known to be NP-complete. We show that this problem is fixed-parameter tractable (FPT) when parameterized by total length of ties. We introduce a new notion of stable non-crossing matching, namely semi-strongly stable non-crossing matching (SSSNM). We prove that the problem of determining the existence of an SSSNM in SMI is NP-complete even if size of every man’s preference list is at most two. On the positive side, we show that this problem is polynomial time solvable if every man’s preference list contains at most one woman.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Adil, D., Gupta, S., Roy, S., Saurabh, S., Zehavi, M.: Parameterized algorithms for stable matching with ties and incomplete lists. Theoret. Comput. Sci. 723, 1–10 (2018)
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158 (1971)
Cygan, M., Fomin, F.V., Kowalik, Ł, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science, Springer Science & Business Media, New York (2012). https://doi.org/10.1007/978-1-4612-0515-9
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9–15 (1962)
Gale, D., Sotomayor, M.: Some remarks on the stable matching problem. Discret. Appl. Math. 11(3), 223–232 (1985)
Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge (1989)
Hamada, K., Miyazaki, S., Okamoto, K.: Strongly stable and maximum weakly stable noncrossing matchings. In: Gasieniec, L., Klasing, R., Radzik, T. (eds.) IWOCA 2020. LNCS, vol. 12126, pp. 304–315. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-48966-3_23
Hamada, K., Miyazaki, S., Okamoto, K.: Strongly stable and maximum weakly stable noncrossing matchings. Algorithmica 83(9), 2678–2696 (2021)
Irving, R.W.: Stable marriage and indifference. Discret. Appl. Math. 48(3), 261–272 (1994)
Manlove, D.: Algorithmics of Matching Under Preferences, vol. 2. World Scientific, Singapore (2013)
Manlove, D.F., Irving, R.W., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoret. Comput. Sci. 276(1–2), 261–279 (2002)
Marx, D., Schlotter, I.: Parameterized complexity and local search approaches for the stable marriage problem with ties. Algorithmica 58(1), 170–187 (2010)
Roth, A.E.: The evolution of the labor market for medical interns and residents: a case study in game theory. J. Polit. Econ. 92(6), 991–1016 (1984)
Roth, A.E.: On the allocation of residents to rural hospitals: a general property of two-sided matching markets. Econometrica J. Econ. Soc. 54, 425–427 (1986)
Ruangwises, S., Itoh, T.: Stable noncrossing matchings. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 405–416. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-25005-8_33
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Illustration of Construction of Instance in the Proof of Theorem 2
A Illustration of Construction of Instance in the Proof of Theorem 2
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Panda, B.S., Sachin (2023). Algorithms and Complexity of Strongly Stable Non-crossing Matchings. In: Bagchi, A., Muthu, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2023. Lecture Notes in Computer Science, vol 13947. Springer, Cham. https://doi.org/10.1007/978-3-031-25211-2_28
Download citation
DOI: https://doi.org/10.1007/978-3-031-25211-2_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25210-5
Online ISBN: 978-3-031-25211-2
eBook Packages: Computer ScienceComputer Science (R0)